{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T04:19:46Z","timestamp":1648786786069},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4064,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0166-218x(01)00269-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:32:09Z","timestamp":1027582329000},"page":"129-138","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for multi-parameter graph optimization problems"],"prefix":"10.1016","volume":"119","author":[{"given":"Ivan","family":"Basov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alek","family":"Vainshtein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00269-4_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","article-title":"Minimal spanning tree subject to a side constraint","volume":"9","author":"Aggarwal","year":"1982","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB2","first-page":"157","article-title":"An approximate algorithm for combinatorial optimization problems with two parameters","volume":"14","author":"Blokh","year":"1996","journal-title":"Austral. J. Combin."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB3","series-title":"Combinatorial Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB4","doi-asserted-by":"crossref","unstructured":"J. Ganley, M. Golin, J. Salowe, The multi-weighted spanning tree problem, in: Computing and Combinatorics, Xi'an, Lecture Notes in Computer Science, Vol. 959, Springer, Berlin, 1995, pp. 141\u2013150.","DOI":"10.1007\/BFb0030828"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual algorithm for the constrained shortest path problem","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problem","volume":"17","author":"Hassin","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB8","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1287\/moor.14.2.362","article-title":"Maximizing classes of two-parameter objectives over matroids","volume":"14","author":"Hassin","year":"1989","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB9","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1002\/net.3230140109","article-title":"Algorithms for finding paths with multiple constraints","volume":"14","author":"Jaffe","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0022-247X(66)90020-5","article-title":"The shortest route problem with constraints","volume":"14","author":"Joksch","year":"1966","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB11","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jagm.1998.0930","article-title":"Bicriteria network design problems","volume":"28","author":"Marathe","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB12","series-title":"Handbook of Discrete and Computational Geometry","first-page":"445","article-title":"Shortest paths and networks","author":"Mitchell","year":"1997"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB13","doi-asserted-by":"crossref","unstructured":"C. Phillips, The network inhibition problem, Proceedings of the 25th ACM Symposium on Theory of Computation, San Diego, CA, 1993, pp. 776\u2013785.","DOI":"10.1145\/167088.167286"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB14","doi-asserted-by":"crossref","unstructured":"S. Ravi, M. Goemans, The constrained minimum spanning tree problem, in: Proceedings of the Fifth Scandinavian Workshop in Algorithm Theory, eds., R. Karlsson and A. Lingas, Reykjavik, 1996, Lecture Notes in Computer Science, Vol. 1097, 1996, pp. 66\u201375.","DOI":"10.1007\/3-540-61422-2_121"},{"key":"10.1016\/S0166-218X(01)00269-4_BIB15","unstructured":"A. Vainshtein, The vector shortest path problem in the l\u221e-norm, Ekonom. i Mat. Metody 21 (1985) 1032\u20131037 (English translation in: A.K. Kelmans (Ed.), Selected Topics in Discrete Mathematics, AMS, Providence, RI, 1994, pp. 207\u2013216)."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB16","unstructured":"A. Vainshtein, The vector shortest path problem in the lp-norm, in: Simulation and Optimization of Complex Systems, ed., G. Fridman, Omsk University Press, Omsk, 1987, 138\u2013144."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB17","unstructured":"A. Vainshtein, The vector shortest path problem and other vector optimization problems on graphs, Proceedings of the 17th Yugoslavian Symposium on Operation Research, Belgrade, 1990, pp. 169\u2013172."},{"key":"10.1016\/S0166-218X(01)00269-4_BIB18","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto optima in multiple-objective shortest path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002694?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002694?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:27:54Z","timestamp":1556720874000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0166218X01002694"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00269-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}