{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:06Z","timestamp":1725544746240},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_68","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"745-756","source":"Crossref","is-referenced-by-count":2,"title":["Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neumann","sequence":"first","affiliation":[]},{"given":"Marco","family":"Laumanns","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Beier, R., V\u00f6cking, B.: Random Knapsack in Expected Polynomial Time. In: Proc. ACM Symposium on Theory of Computing (STOC), pp. 306\u2013329 (2003)","DOI":"10.1016\/j.jcss.2004.04.004"},{"key":"68_CR2","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"key":"68_CR3","unstructured":"Fischer, T.: Optimizing the Degree of Minimum Weight Spanning Trees. Technical Report 93-1338, Department of Computer Science, Cornell University, Ithaca, NY, USA (1993)"},{"key":"68_CR4","unstructured":"F\u00fcrer, M., Raghavachari, B.: An NC approximation algorithm for the minimum degree spanning tree problem. In: Proc. of the 28th Annual Allerton Conf. on Communication, Control and Computing, pp. 274\u2013281 (1990)"},{"key":"68_CR5","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the Minimum-Degree Spanning Tree to within One from the Optimal Degree. In: Proc. of the third annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 317\u2013324 (1992)"},{"key":"68_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M. F\u00fcrer","year":"1994","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the Minimum-Degree Steiner Tree to within One of Optimal. Journal of Algorithms\u00a017, 409\u2013423 (1994)","journal-title":"Journal of Algorithms"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual meets local search: approximating MST\u2019s with nonuniform degree bounds. In: Proc. ACM Symposium on Theory of Computing (STOC), pp. 389\u2013395 (2003)","DOI":"10.1145\/780596.780600"},{"key":"68_CR8","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1145\/1068009.1068139","volume-title":"Genetic and Evolutionary Computation Conference - GECCO 2005","author":"F. Neumann","year":"2005","unstructured":"Neumann, F., Wegener, I.: Minimum spanning trees made easier via multi-objective optimization. In: Beyer, et al. (eds.) Genetic and Evolutionary Computation Conference - GECCO 2005, vol.\u00a01, pp. 763\u2013770. ACM Press, New York (2005)"},{"key":"68_CR9","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of tradeoffs, and optimal access of web sources. In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000 (2000)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:18:40Z","timestamp":1555460320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11682462_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}