{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T06:09:04Z","timestamp":1725775744259},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780600","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"389-395","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Primal-dual meets local search"],"prefix":"10.1145","author":[{"given":"Jochen","family":"K\u00f6nemann","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103437"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90029-1"},{"key":"e_1_3_2_1_3_1","first-page":"274","volume-title":"Proc. of the 28th Annual Allerton Conf. on Communication, Control and Computing","author":"Furer M.","year":"1990"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_1_5_1","first-page":"307","volume-title":"Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '92)","author":"Goemans M. X.","year":"1992"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_7_1","first-page":"144","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Goemans M. X.","year":"1997"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335371"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970036917X"},{"key":"e_1_3_2_1_10_1","first-page":"21","article-title":"The directed minimum-degree spanning tree problem","author":"Krishnan R.","year":"2001","journal-title":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167209"},{"key":"e_1_3_2_1_13_1","first-page":"31","article-title":"Approximation algorithms for degree-constrained minimum-cost network-design problems","author":"Ravi R.","year":"2001","journal-title":"Algorithmica"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646830.707571"}],"event":{"name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego CA USA","acronym":"STOC03"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T05:35:39Z","timestamp":1672983339000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780600"}},"subtitle":["approximating MST's with nonuniform degree bounds"],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":14,"alternative-id":["10.1145\/780542.780600","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780600","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}