{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:48Z","timestamp":1725482208118},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_9","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T12:02:55Z","timestamp":1175774575000},"page":"78-89","source":"Crossref","is-referenced-by-count":1,"title":["On Minimum Diameter Spanning Trees under Reload Costs"],"prefix":"10.1007","author":[{"given":"Hans-Christoph","family":"Wirth","sequence":"first","affiliation":[]},{"given":"Jan","family":"Steffan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R.-S. Chang and S.-J. Leu, The minimum labeling spanning trees, Information Processing Letters 63 (1997), 277\u2013282. 79","DOI":"10.1016\/S0020-0190(97)00127-0"},{"key":"9_CR2","volume-title":"Computers and intractability (a guide to the theory of NP-completeness)","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and intractability (a guide to the theory of NP-completeness), W.H. Freeman and Company, New York, 1979. 81"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R. Hassin","year":"1995","unstructured":"R. Hassin and A. Tamir, On the minimum diameter spanning tree problem, Information processing letters 53 (1995), 109\u2013111. 79, 84, 88","journal-title":"Information processing letters"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"O. Kariv and S. L. Hakimi, An algorithmic approach to network location problems, part I: The p-center, SIAM Journal of Applied Mathematics 37 (1979), 513\u2013537. 79","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0190(98)00034-9","volume":"66","author":"S. O. Krumke","year":"1998","unstructured":"S. O. Krumke and H.-C. Wirth, On the minimum label spanning tree problem, Information Processing Letters 66 (1998), no. 2, 81\u201385. 79","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:38:08Z","timestamp":1556336288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}