{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T20:57:27Z","timestamp":1793134647599,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_99","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"1201-1213","source":"Crossref","is-referenced-by-count":12,"title":["Efficiently Computing Succinct Trade-Off Curves"],"prefix":"10.1007","author":[{"given":"Sergei","family":"Vassilvitskii","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"99_CR1","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S1052623495288192","volume":"8","author":"T.C.E. Cheng","year":"1998","unstructured":"Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. SIAM J. Optimization\u00a08(2), 617\u2013630 (1998)","journal-title":"SIAM J. Optimization"},{"key":"99_CR2","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Guha, S., Halperin, E., Khanna, S., Kortsartz, G., Naor Asymmetric, S.: k-center is log\u2217 n-hard to Approximate. To appear in Proc. STOC 2004 (2004)","DOI":"10.1145\/1007352.1007363"},{"key":"99_CR3","volume-title":"Multicriteria Analysis","year":"1997","unstructured":"Climacao, J. (ed.): Multicriteria Analysis. Springer, Heidelberg (1997)"},{"key":"99_CR4","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)"},{"issue":"5","key":"99_CR5","doi-asserted-by":"publisher","first-page":"237","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\u00a083(5), 237\u2013293 (2002)","journal-title":"Information Processing Letters"},{"key":"99_CR6","doi-asserted-by":"crossref","unstructured":"Guha, S., Gunopoulos, D., Koudas, N., Srivastava, D., Vlachos, M.: Efficient Approximation of Optimization Queries Under Parametric Aggregation Constraints. In: Proc. 29th VLDB (2003)","DOI":"10.1016\/B978-012722442-8\/50074-4"},{"key":"99_CR7","series-title":"LNEMS","first-page":"109","volume-title":"Proc. 3rd Conf. Multiple Criteria Decision Making Theory and Application","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bicriterion Path Problems. In: Proc. 3rd Conf. Multiple Criteria Decision Making Theory and Application. LNEMS, vol.\u00a0177, pp. 109\u2013127. Springer, Heidelberg (1979)"},{"key":"99_CR8","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the Approximability of Trade-offs and Optimal Access of Web Sources. In: Proceedings 41st IEEE Symp. on Foundations of Computer Science (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"99_CR9","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Multiobjective Query Optimization. In: Proceedings of PODS 2001 (2001)","DOI":"10.1145\/375551.375560"},{"key":"99_CR10","doi-asserted-by":"crossref","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Many Birds with One Stone: Multi-objective Approximation Algorithms. In: Proc. 25th STOC, pp. 438\u2013447 (1993)","DOI":"10.1145\/167088.167209"},{"key":"99_CR11","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","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_99.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:24:10Z","timestamp":1605741850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}