{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:01Z","timestamp":1725573361308},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_68","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"675-684","source":"Crossref","is-referenced-by-count":7,"title":["Decision Making Based on Approximate and Smoothed Pareto Curves"],"prefix":"10.1007","author":[{"given":"Heiner","family":"Ackermann","sequence":"first","affiliation":[]},{"given":"Alantha","family":"Newman","sequence":"additional","affiliation":[]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Eppstein, D., Guibas, L.J., Henzinger, M.R.: Parametric and kinetic minimum spanning trees. In: IEEE Symposium on Foundations of Computer Science, pp. 596\u2013605 (1998)","DOI":"10.1109\/SFCS.1998.743510"},{"key":"68_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0166-218X(87)90067-9","volume":"16","author":"F. Barahona","year":"1987","unstructured":"Barahona, F., Pulleyblank, W.R.: Exact arborescences, matchings and cycles. Discrete Applied Mathematics\u00a016, 91\u201399 (1987)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"68_CR3","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.jcss.2004.04.004","volume":"69","author":"R. Beier","year":"2004","unstructured":"Beier, R., V\u00f6cking, B.: Random Knapsack in Expected Polynomial Time. Journal of Computer and System Sciences\u00a069(3), 306\u2013329 (2004)","journal-title":"Journal of Computer and System Sciences"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Beier, R., V\u00f6cking, B.: Typical Properties of Winners and Losers in Discrete Optimization. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC-2004), pp. 343\u2013352 (2004)","DOI":"10.1145\/1007352.1007409"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"Dey, T.K.: Improved bounds on planar k-sets and k-levels. In: IEEE Symposium on Foundations of Computer Science, pp. 161\u2013165 (1997)","DOI":"10.1109\/SFCS.1997.646104"},{"key":"68_CR6","series-title":"Lecture Notes in Economics and Mathematical Systems","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. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0491. Springer, Heidelberg (2000)"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Hansen, P.: Bicriterion path problems. In: Programming Languages and their Definition. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0177, pp. 109\u2013127 (1980)","DOI":"10.1007\/978-3-642-48782-8_9"},{"issue":"2","key":"68_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0377-2217(86)90092-5","volume":"25","author":"M.I. Henig","year":"1986","unstructured":"Henig, M.I.: The shortest path problem with two objective functions. European Journal of Operational Research\u00a025(2), 281\u2013291 (1986)","journal-title":"European Journal of Operational Research"},{"key":"68_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02598-7","volume-title":"Global Optimization","author":"R. Horst","year":"1990","unstructured":"Horst, R., Tuy, H.: Global Optimization. Springer, Heidelberg (1990)"},{"key":"68_CR10","first-page":"321","volume":"75","author":"N. Katoh","year":"1992","unstructured":"Katoh, N.: Bicriteria network optimization problems. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences\u00a0E75-A, 321\u2013329 (1992)","journal-title":"IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"1","key":"68_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica\u00a07(1), 105\u2013114 (1987)","journal-title":"Combinatorica"},{"issue":"2","key":"68_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of restricted spanning tree problems. Journal of the ACM\u00a029(2), 285\u2013309 (1982)","journal-title":"Journal of the ACM"},{"key":"68_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/SFCS.2000.892068","volume-title":"FOCS 2000: Proceedings of the 41st Annual Symposium on Foundations of Computer Science","author":"C.H. Papadimitriou","year":"2000","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: FOCS 2000: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 86\u201392. IEEE Computer Society, Los Alamitos (2000)"},{"issue":"3","key":"68_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time. Journal of the ACM\u00a051(3), 385\u2013463 (2004)","journal-title":"Journal of the ACM"},{"key":"68_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/978-3-540-30140-0_72","volume-title":"Algorithms \u2013 ESA 2004","author":"G. Tsaggouris","year":"2004","unstructured":"Tsaggouris, G., Zaroliagis, C.: Non-additive shortest paths. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 822\u2013834. Springer, Heidelberg (2004)"},{"key":"68_CR16","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)"},{"issue":"1","key":"68_CR17","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(1), 70\u201378 (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\/11602613_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:04Z","timestamp":1619506984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11602613_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}