{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:08:35Z","timestamp":1744434515199},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1007\/bf02679617","type":"journal-article","created":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T00:42:49Z","timestamp":1185669769000},"page":"148-180","source":"Crossref","is-referenced-by-count":2,"title":["Near-optimal bounded-degree spanning trees"],"prefix":"10.1007","volume":"29","author":[{"given":"J. C.","family":"Hansen","sequence":"first","affiliation":[]},{"given":"E.","family":"Schmutz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02679617_CR1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/moor.18.2.267","volume":"18","author":"M.X. Goemans","year":"1993","unstructured":"M.X. Goemans and M.S. Kodialam, A lower bound on the expected cost of an optimal assignment,Math. Oper. Res. 18 (1993), 267\u2013274.","journal-title":"Math. Oper. Res."},{"key":"BF02679617_CR2","unstructured":"B. Olin, Asymptotic properties of random assignment problems, Ph.D. thesis, Kungl Tekniska Hogskolan, Stockholm, 1992."},{"issue":"2","key":"BF02679617_CR3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<113::AID-RSA1>3.0.CO;2-S","volume":"15","author":"D. Coppersmith","year":"1999","unstructured":"D. Coppersmith and G. Sorkin, Constructive bounds and exact expectations for the random assignment problem,Random Struct. Algorithms 15(2) (1999), 113\u2013144.","journal-title":"Random Struct. Algorithms"},{"key":"BF02679617_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(85)90058-7","volume":"10","author":"A.M. Frieze","year":"1985","unstructured":"A.M. Frieze, On the value of a random minimum spanning tree problem,Discrete Appl. Math. 10(1985), 47\u201356.","journal-title":"Discrete Appl. Math."},{"key":"BF02679617_CR5","unstructured":"A. Beveridge, A.M. Frieze, and C.J.H. McDiarmid, Random minimum length spanning trees in regular graphs, Preprint."},{"issue":"4","key":"BF02679617_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF02125348","volume":"9","author":"A.M. Frieze","year":"1989","unstructured":"A.M. Frieze and C.J.H. McDiarmid, On random minimum length spanning trees,Combinatorica 9(4) (1989), 363\u2013374.","journal-title":"Combinatorica"},{"key":"BF02679617_CR7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1137\/S0097539794264585","volume":"25","author":"S. Khuller","year":"1996","unstructured":"S. Khuller, B. Raghavachari, and N. Young, Low-degree spanning trees of small weight,SIAM J. Comput. 25 (1996), 355\u2013368.","journal-title":"SIAM J. Comput."},{"key":"BF02679617_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/S0963548397003052","volume":"6","author":"J.C. Hansen","year":"1997","unstructured":"J.C. Hansen, Limit laws for the optimal directed tree with random costs,Combin. Probab. Comput. 6 (1997), 315\u2013335.","journal-title":"Combin. Probab. Comput."},{"key":"BF02679617_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF02592060","volume":"36","author":"C. McDiarmid","year":"1986","unstructured":"C. McDiarmid, On the greedy algorithm with random costs,Math. Programming 36 (1986), 245\u2013255.","journal-title":"Math. Programming"},{"key":"BF02679617_CR10","first-page":"481","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1990","unstructured":"M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali,Linear Programming and Network Flows, 2nd edn., Wiley, London, 1990, page 481.","edition":"2nd edn."},{"key":"BF02679617_CR11","first-page":"181","volume-title":"The Traveling Salesman Problem","author":"R.M. Karp","year":"1985","unstructured":"R.M. Karp and M. Steele, Probabilistic analysis of heuristics, inThe Traveling Salesman Problem, ed. Eugene L. Lawler et al., Wiley, London, 1985, pages 181\u2013205."},{"key":"BF02679617_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(93)90364-Y","volume":"114","author":"P. Flajolet","year":"1993","unstructured":"P. Flajolet and M. Soria, General combinatorial schemas with Gausssian limit distributions and exponential tails,Discrete Math. 114 (1993), 159\u2013180.","journal-title":"Discrete Math."},{"key":"BF02679617_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970029","volume-title":"Probability in Combinatorial Optimization","author":"J.M. Steele","year":"1997","unstructured":"J.M. Steele,Probability in Combinatorial Optimization, SIAM, Philadelphia, PA, 1997."},{"key":"BF02679617_CR14","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF01192719","volume":"93","author":"D. Aldous","year":"1992","unstructured":"D. Aldous, Asymptotics in the random assignment problem,Probab. Theory Appl. 93 (1992), 507\u2013534.","journal-title":"Probab. Theory Appl."},{"key":"BF02679617_CR15","first-page":"206","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability, Freeman, San Francisco, CA, 1979, page 206."},{"key":"BF02679617_CR16","doi-asserted-by":"crossref","first-page":"2015","DOI":"10.1088\/0305-4470\/33\/10\/305","volume":"33","author":"V.S. Dotsenko","year":"2000","unstructured":"V.S. Dotsenko, Exact solution of the random bipartite matching model,J. Phys. A 33 (2000), 2015\u20132030.","journal-title":"J. Phys. A"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679617.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02679617\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T07:52:18Z","timestamp":1558338738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02679617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["BF02679617"],"URL":"https:\/\/doi.org\/10.1007\/bf02679617","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}