{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T19:20:56Z","timestamp":1791314456975,"version":"4.3.1"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,11]]},"DOI":"10.1145\/1250790.1250887","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T12:07:37Z","timestamp":1189771657000},"page":"661-670","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":98,"title":["Approximating minimum bounded degree spanning trees to within one of optimal"],"prefix":"10.1145","author":[{"given":"Mohit","family":"Singh","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Shatin, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_18"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90023-6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0016-z"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582008"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584082"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.006"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.R.","year":"1979","unstructured":"M.R. Garey and D.S. Johnson , Computers and Intractability: A Guide to the Theory of NP-Completeness , W. H. Freeman & Co. , New York, NY, USA , 1979 . M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, USA, 1979."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.48"},{"key":"e_1_3_2_1_11_1","volume-title":"Approximation algorithms for NP-hard problems","author":"Hochbaum D.S.","year":"1997","unstructured":"D.S. Hochbaum , Approximation algorithms for NP-hard problems , PWS Publishing Co. , Boston, MA, USA , 1997 . D.S. Hochbaum, Approximation algorithms for NP-hard problems, PWS Publishing Co., Boston, MA, USA, 1997."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970036917X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702418048"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250886"},{"key":"e_1_3_2_1_16_1","volume-title":"Network Models, Handbook in Operations Research and Management Science","author":"Magnanti T.","year":"1995","unstructured":"T. Magnanti , L. Wolsey , Optimal trees , Network Models, Handbook in Operations Research and Management Science , M.O. Ball et al ed., Amsterdam , North-Holland , pp: 503--615, 1995 . T. Magnanti, L. Wolsey, Optimal trees, Network Models, Handbook in Operations Research and Management Science, M.O. Ball et al ed., Amsterdam, North-Holland, pp: 503--615, 1995."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v43:4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167209"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_16"},{"key":"e_1_3_2_1_20_1","volume-title":"Combinatorial Optimization - Polyhedra and Efficiency","author":"Schrijver A.","year":"2005","unstructured":"A. Schrijver , Combinatorial Optimization - Polyhedra and Efficiency , Springer-Verlag , New York , 2005 . A. Schrijver, Combinatorial Optimization - Polyhedra and Efficiency, Springer-Verlag, New York, 2005."},{"key":"e_1_3_2_1_21_1","volume-title":"Approximation Algorithms","author":"Vazirani V.","year":"2001","unstructured":"V. Vazirani , Approximation Algorithms , Springer , 2001 . V. Vazirani, Approximation Algorithms, Springer, 2001."}],"event":{"name":"STOC07: Symposium on Theory of Computing","location":"San Diego California USA","acronym":"STOC07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250887","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:47Z","timestamp":1750243667000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":21,"alternative-id":["10.1145\/1250790.1250887","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250887","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}