{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:37:04Z","timestamp":1759667824527},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00030-4","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"139-155","source":"Crossref","is-referenced-by-count":16,"title":["Improving spanning trees by upgrading nodes"],"prefix":"10.1016","volume":"221","author":[{"given":"Sven O.","family":"Krumke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Noltemeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-C.","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhav V.","family":"Marathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0304-3975(99)00030-4_bib1","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","article-title":"An algebraic theory of graph reductions","volume":"40","author":"Arnborg","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00030-4_bib2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02060467","article-title":"Improving the location of minisum facilities through network modification","volume":"40","author":"Berman","year":"1992","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0304-3975(99)00030-4_bib3","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear-time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00030-4_bib4","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(99)00030-4_bib5","series-title":"Proc. 28th Annual ACM Symp. on the Theory of Computing (STOC'96)","first-page":"314","article-title":"A threshold of ln n for approximating set cover","author":"Feige","year":"1996"},{"key":"10.1016\/S0304-3975(99)00030-4_bib6","series-title":"Computers and Intractability (A Guide to the Theory of NP-Completeness)","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(99)00030-4_bib7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jagm.1997.0856","article-title":"Edge weight reduction problems in directed acyclic graphs","volume":"24","author":"Hambrush","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00030-4_bib8","series-title":"Network Design: Connectivity and Facilities Location","first-page":"247","article-title":"Network improvement problems","volume":"vol. 40","author":"Krumke","year":"1998"},{"key":"10.1016\/S0304-3975(99)00030-4_bib9","series-title":"Proc. 22nd Int. Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"293","article-title":"Modifying networks to obtain low cost trees","volume":"vol. 1197","author":"Krumke","year":"1996"},{"key":"10.1016\/S0304-3975(99)00030-4_bib10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0304-3975(97)00290-9","article-title":"Modifying networks to obtain low cost subgraphs","volume":"203","author":"Krumke","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00030-4_bib11","article-title":"On the approximability of location and network design problems","author":"Krumke","year":"1996"},{"key":"10.1016\/S0304-3975(99)00030-4_bib12","series-title":"Proc. 29th Annual IEEE Symp. on the Foundations of Computer Science (FOCS'88)","first-page":"422","article-title":"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms","author":"Leighton","year":"1988"},{"key":"10.1016\/S0304-3975(99)00030-4_bib13","series-title":"Proc. 25th Annual ACM Symp. on the Theory of Computing (STOC'93)","first-page":"288","article-title":"The network inhibition problem","author":"Phillips","year":"1993"},{"key":"10.1016\/S0304-3975(99)00030-4_bib14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.3230260105","article-title":"Network upgrading problems","volume":"26","author":"Paik","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(99)00030-4_bib15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","article-title":"Graph minors IV, treewidth and well-quasi-ordering","volume":"48","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"10.1016\/S0304-3975(99)00030-4_bib16","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000304?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000304?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:21:16Z","timestamp":1555406476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000304"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00030-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}