{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:55:13Z","timestamp":1761922513959,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0377-2217(99)00458-0","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"278-282","source":"Crossref","is-referenced-by-count":9,"title":["The vertex degrees of minimum spanning trees"],"prefix":"10.1016","volume":"125","author":[{"given":"Dietmar","family":"Cieslik","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00458-0_BIB1","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1090\/dimacs\/040\/05","article-title":"Using Hadwiger numbers in network design","volume":"40","author":"Cieslik","year":"1998","journal-title":"DIMACS Series in Discrete Mathematics Theoretical Computer Science"},{"year":"1998","author":"Cieslik","series-title":"Steiner Minimal Trees","key":"10.1016\/S0377-2217(99)00458-0_BIB3"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","article-title":"Efficient algorithms for a family of matroid intersection problems","volume":"5","author":"Gabow","year":"1984","journal-title":"Journal of Algorithms"},{"unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractibility, San Francisco, 1980","key":"10.1016\/S0377-2217(99)00458-0_BIB5"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","article-title":"Topological design of centralized computer networks-formulations and algorithms","volume":"12","author":"Gavish","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","article-title":"On the history of the minimum spanning tree problem","volume":"7","author":"Graham","year":"1985","journal-title":"Annals of the History of Computing"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/BF01322659","article-title":"Absch\u00e4tzungen f\u00fcr die Anzahl der konvexen K\u00f6rper die einen konvexen K\u00f6rper ber\u00fchren","volume":"65","author":"Groemer","year":"1961","journal-title":"Monatshefte f\u00fcr Mathematik"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2140\/pjm.1961.11.215","article-title":"On a conjecture of H. Hadwiger","volume":"11","author":"Gr\u00fcnbaum","year":"1961","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01899995","article-title":"\u00dcber Treffanzahl bei Translationsgleichen Eichk\u00f6rpern","volume":"8","author":"Hadwiger","year":"1957","journal-title":"Archives of Mathematics"},{"unstructured":"D. Jungnickel, Graphen, Netzwerke und Algorithmen, BI Wissenschafts, Mannheim, 1994","key":"10.1016\/S0377-2217(99)00458-0_BIB11"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB12","doi-asserted-by":"crossref","first-page":"677","DOI":"10.2307\/2307838","article-title":"A property of Minkowski circles","volume":"57","author":"Kelley","year":"1950","journal-title":"The American Mathematical Monthly"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB13","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the travelling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proceedings of The American Mathematical Society"},{"unstructured":"A. Migdalas, Mathematical programming techniques for analysis and design of communication and transportation networks, Link\u00f6ping Studies in Science and Technology, Link\u00f6ping, 1988","key":"10.1016\/S0377-2217(99)00458-0_BIB14"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02570700","article-title":"Low-degree minimum spanning trees","volume":"14","author":"Robins","year":"1995","journal-title":"Discrete & Computational Geometry"},{"key":"10.1016\/S0377-2217(99)00458-0_BIB16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","article-title":"On two geometric problems related to the traveling salesman problem","volume":"5","author":"Papadimitriou","year":"1984","journal-title":"Journal of Algorithms"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004580?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004580?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T05:23:23Z","timestamp":1555219403000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0377221799004580"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00458-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}