{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T00:40:37Z","timestamp":1776127237411,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T00:00:00Z","timestamp":1509667200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Research, Development and Innovation Office (HU)","award":["OTKA 112881"],"award-info":[{"award-number":["OTKA 112881"]}]},{"name":"Ministry of National Economy of Hungary","award":["GINOP 2.3.2-15-2016-00002"],"award-info":[{"award-number":["GINOP 2.3.2-15-2016-00002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11590-017-1212-z","type":"journal-article","created":{"date-parts":[[2017,11,3]],"date-time":"2017-11-03T13:38:36Z","timestamp":1509716316000},"page":"475-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Multi-criteria approximation schemes for the resource constrained shortest path problem"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1062-6272","authenticated-orcid":false,"given":"Mark\u00f3","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2759-1264","authenticated-orcid":false,"given":"Tam\u00e1s","family":"Kis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,3]]},"reference":[{"key":"1212_CR1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162, 439\u2013485 (2005)","journal-title":"Ann. Math."},{"issue":"5","key":"1212_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F Ergun","year":"2002","unstructured":"Ergun, F., Sinha, R., Zhang, L.: An improved FPTAS for restricted shortest path. Information Processing Letters 83(5), 287\u2013291 (2002)","journal-title":"Information Processing Letters"},{"issue":"17","key":"1212_CR3","doi-asserted-by":"crossref","first-page":"3081","DOI":"10.1016\/j.comnet.2010.05.017","volume":"54","author":"RG Garroppo","year":"2010","unstructured":"Garroppo, R.G., Giordano, S., Tavanti, L.: A survey on multi-constrained optimal path computation: exact and approximate algorithms. Comput. Netw. 54(17), 3081\u20133107 (2010)","journal-title":"Comput. Netw."},{"key":"1212_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company, New York (1979)"},{"key":"1212_CR5","doi-asserted-by":"crossref","unstructured":"Goel, A., Ramakrishnan, K.G., Kataria, D., Logothetis, D.: Efficient computation of delay-sensitive routes from one source to all destinations. In: INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol\u00a02, pp. 854\u2013858. IEEE (2001)","DOI":"10.1109\/INFCOM.2001.916276"},{"issue":"1\u20132","key":"1212_CR6","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10107-013-0703-7","volume":"146","author":"F Grandoni","year":"2014","unstructured":"Grandoni, F., Ravi, R., Singh, M., Zenklusen, R.: New approaches to multi-objective optimization. Math. Program. 146(1\u20132), 525\u2013554 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1212_CR7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1), 36\u201342 (1992)","journal-title":"Math. Oper. Res."},{"key":"1212_CR8","doi-asserted-by":"crossref","unstructured":"Hastad, J.: Clique is hard to approximate within $$n^{1-\\varepsilon }$$ n 1 - \u03b5 . In: Foundations of Computer Science, 1996. Proceedings, 37th Annual Symposium on IEEE, pp. 627\u2013636. IEEE (1996)","DOI":"10.1109\/SFCS.1996.548522"},{"issue":"5","key":"1212_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5), 213\u2013219 (2001)","journal-title":"Oper. Res. Lett."},{"key":"1212_CR10","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on IEEE, pp. 86\u201392. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"5","key":"1212_CR11","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/TC.2006.67","volume":"55","author":"M Song","year":"2006","unstructured":"Song, M., Sahni, S.: Approximation algorithms for multiconstrained quality-of-service routing. IEEE Trans. Comput. 55(5), 603\u2013617 (2006)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"1212_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"HM Weingartner","year":"1967","unstructured":"Weingartner, H.M., Ness, D.N.: Methods for the solution of the multidimensional 0\/1 knapsack problem. Oper. Res. 15(1), 83\u2013103 (1967)","journal-title":"Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1212-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1212-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1212-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T21:12:43Z","timestamp":1750972363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1212-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1212"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1212-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,3]]}}}