{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:31Z","timestamp":1725566131671},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228943"},{"type":"electronic","value":"9783540278214"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27821-4_5","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T14:54:06Z","timestamp":1284476046000},"page":"51-60","source":"Crossref","is-referenced-by-count":16,"title":["On the Crossing Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Luker, G.: Testing for the consecutive ones property, interval graphs and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences\u00a013, 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR2","volume-title":"Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS)","author":"V. Bilo","year":"2004","unstructured":"Bilo, V., Flammini, M.: On the IP routing tables minimization with addresses reassignments. In: Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Press, Los Alamitos (2004)"},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/BF01944351","volume":"16","author":"M. Flammini","year":"1996","unstructured":"Flammini, M., Gambosi, G., Salomone, S.: Interval Routing schemes. Algorithmica\u00a016(6), 549\u2013568 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1093\/comjnl\/41.1.16","volume":"41","author":"M. Flammini","year":"1998","unstructured":"Flammini, M., Marchetti-Spaccamela, A., van Leeuwen, J.: The Complexity of Interval Routing on Random Graphs. The Computer Journal\u00a041(1), 16\u201325 (1998)","journal-title":"The Computer Journal"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, C., Martin, Kaplan, H., Shamir, R.: Four Strikes against Physical Mapping. Journal of Computational Biology\u00a02(1), 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1089\/cmb.1995.2.219","volume":"2","author":"D.S. Greenberg","year":"1995","unstructured":"Greenberg, D.S., Istrail, S.: Physical mapping by STS Hybridization: Algorithmic strategies and the challenges of software evaluation. Journal of Computational Biology\u00a02(2), 219\u2013273 (1995)","journal-title":"Journal of Computational Biology"},{"key":"5_CR7","volume-title":"Computers and Intractibility: A guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractibility: A guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"5_CR8","unstructured":"Furer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proceedings of the Third Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 1992), pp. 317\u2013324 (1992)"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"P.N. Klein","year":"1995","unstructured":"Klein, P.N., Ravi, R.: A Nearly Best-Possible Approximation Algorithm for Node- Weighted Steiner. Trees. J. Algorithms\u00a019(1), 104\u2013115 (1995)","journal-title":"Trees. J. Algorithms"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.: Randomized Rounding. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27821-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:29:59Z","timestamp":1619998199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27821-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228943","9783540278214"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27821-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}