{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:51:37Z","timestamp":1742799097794},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_40","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T05:57:35Z","timestamp":1164779855000},"page":"389-398","source":"Crossref","is-referenced-by-count":16,"title":["Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications"],"prefix":"10.1007","author":[{"given":"George","family":"Tsaggouris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/11602613_68","volume-title":"Algorithms and Computation","author":"H. Ackermann","year":"2005","unstructured":"Ackermann, H., Newman, A., R\u00f6glin, H., V\u00f6cking, B.: Decision Making Based on Approximate and Smoothed Pareto Curves. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 675\u2013684. Springer, Heidelberg (2005); (full version as Tech.\u00a0Report AIB-2005-23, RWTH Aachen, December 2005)"},{"issue":"1","key":"40_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF00938761","volume":"46","author":"H. Corley","year":"1985","unstructured":"Corley, H., Moon, I.: Shortest Paths in Networks with Vector Weights. Journal of Optimization Theory and Applications\u00a046(1), 79\u201386 (1985)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"40_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2000)"},{"volume-title":"Multiple Criteria Optimization \u2013 state of the art annotated bibliographic surveys","year":"2002","key":"40_CR4","unstructured":"Ehrgott, M., Gandibleux, X. (eds.): Multiple Criteria Optimization \u2013 state of the art annotated bibliographic surveys. Kluwer Academic Publishers, Boston (2002)"},{"issue":"4","key":"40_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1287\/trsc.31.4.337","volume":"31","author":"S. Gabriel","year":"1997","unstructured":"Gabriel, S., Bernstein, D.: The Traffic Equilibrium Problem with Nonadditive Path Costs. Transportation Science\u00a031(4), 337\u2013348 (1997)","journal-title":"Transportation Science"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009621108971","volume":"6","author":"S. Gabriel","year":"2000","unstructured":"Gabriel, S., Bernstein, D.: Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models. Computational & Mathematical Organization Theory\u00a06, 29\u201345 (2000)","journal-title":"Computational & Mathematical Organization Theory"},{"key":"40_CR7","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: Proc.\u00a0IEEE Conf.\u00a0Comput.\u00a0Commun. \u2013 INFOCOM (2001)","DOI":"10.1109\/INFCOM.2001.916276"},{"key":"40_CR8","series-title":"LNEMS","first-page":"109","volume-title":"Proc.\u00a03rd Conf.\u00a0Multiple Criteria Decision Making \u2013 Theory and Applications","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bicriterion Path Problems. In: Proc.\u00a03rd Conf.\u00a0Multiple Criteria Decision Making \u2013 Theory and Applications. LNEMS, vol.\u00a0117, pp. 109\u2013127. Springer, Heidelberg (1979)"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D.H. Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Operations Res.\u00a0Lett.\u00a028, 213\u2013219 (2001)","journal-title":"Operations Res.\u00a0Lett."},{"key":"40_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-45190-7_3","volume-title":"Quality of Future Internet Services","author":"P. Mieghem Van","year":"2003","unstructured":"Van Mieghem, P., Kuipers, F.A., Korkmaz, T., Krunz, M., Curado, M., Monteiro, E., Masip-Bruin, X., Sole-Pareta, J., Sanchez-Lopez, S.: Quality of Service Routing, ch. 3. In: Smirnov, M. (ed.) Quality of Future Internet Services. LNCS, vol.\u00a02856, pp. 80\u2013117. Springer, Heidelberg (2003)"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the Approximability of Trade-offs and Optimal Access of Web Sources. In: Proc.\u00a041st Symp.\u00a0on Foundations of Computer Science \u2013 FOCS 2000, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"40_CR12","unstructured":"Tsaggouris, G., Zaroliagis, C.: Improved FPTAS for Multiobjective Shortest Paths with Applications, CTI Techn.\u00a0Report TR-2005\/07\/03 (July 2005)"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Tsaggouris, G., Zaroliagis, C.: Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications, CTI Techn.\u00a0Report TR-2006\/03\/01 (March 2006)","DOI":"10.1007\/11940128_40"},{"key":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1007\/978-3-540-27836-8_99","volume-title":"Automata, Languages and Programming","author":"S. Vassilvitskii","year":"2004","unstructured":"Vassilvitskii, S., Yannakakis, M.: Efficiently Computing Succinct Trade-off Curves. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1201\u20131213. Springer, Heidelberg (2004)"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of Pareto Optima in Multiple-Objective Shortest Path Problems. Operations Research\u00a035, 70\u201379 (1987)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:49:56Z","timestamp":1619509796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11940128_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}