{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:27Z","timestamp":1725549687627},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_18","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"195-204","source":"Crossref","is-referenced-by-count":2,"title":["The Minimum-Area Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Paz","family":"Carmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"\u00c1brego, B., Araujo, G., Arkin, E., Fern\u00e1ndez, S., Hurtado, F., Kano, M., Mitchell, J.S.B., na Pulido, E.O., Rivera-Campo, E., Urrutia, J., Valencia, P.: Matching points with geometric objects. Manuscript, Universitat Polit\u00e8cnica de Catalunya (November 2003)"},{"key":"18_CR2","unstructured":"Andreae, T.: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Tech. Report 74, Mathematisches Seminar, University of Hamburg (1998)"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480192240226","volume":"8","author":"T. Andreae","year":"1995","unstructured":"Andreae, T., Bandelt, H.-J.: Performance guarantees for approximation algorithms depending on parameterized triangle inequalities. SIAM Journal of Discrete Mathematics\u00a08(1), 1\u201316 (1995)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"1-2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(99)00160-X","volume":"73","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Chekuri, C.: Performance guarantees for the tsp with a parameterized triangle inequality. Inf. Process. Lett.\u00a073(1-2), 17\u201321 (2000)","journal-title":"Inf. Process. Lett."},{"key":"18_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"18_CR6","unstructured":"Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity (2000)"},{"key":"18_CR7","first-page":"425","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier, Amsterdam (1999)"},{"key":"18_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"R.L. Graham","year":"1985","unstructured":"Graham, R.L., Hell, P.: On the history of the minimum spanning tree problem. Annals of the History of Computing\u00a07, 43\u201357 (1985)","journal-title":"Annals of the History of Computing"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BFb0023473","volume-title":"STACS 97","author":"L.M. Kirousis","year":"1997","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol.\u00a01200, pp. 363\u2013374. Springer, Heidelberg (1997)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in intersection graph theory. In: Monographs on Discrete Mathematics and Applications, vol.\u00a02. SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719802"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:27Z","timestamp":1619506287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11534273_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}