{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:37:04Z","timestamp":1750307824750,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"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":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374486","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"769-778","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Additive guarantees for degree bounded directed network design"],"prefix":"10.1145","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[{"name":"IBM T. J. Watson Research, Yorktown Heights, NY, USA"}]},{"given":"Rohit","family":"Khandekar","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research, Yorktown Heights, NY, USA"}]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.v42:4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27821-4_5"},{"key":"e_1_3_2_1_3_1","volume-title":"ICALP","author":"Chaudhuri K.","year":"2006","unstructured":"K. Chaudhuri , S. Rao , S. Riesenfeld , and K. Talwar . Push relabel and an improved approximation algorithm for the bounded degree MST problem . In ICALP , 2006 .]] K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar. Push relabel and an improved approximation algorithm for the bounded degree MST problem. In ICALP, 2006.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70817-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050040"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496915_29"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.48"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788814.1788838"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v44:3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970036917X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250886"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374485"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01681329"},{"key":"e_1_3_2_1_16_1","volume-title":"IPCO","author":"Vardges","year":"1999","unstructured":"Vardges Melkonian and \u00c9va Tardos. Approximation algorithms for a directed network design problem . In IPCO , 1999 .]] Vardges Melkonian and \u00c9va Tardos. Approximation algorithms for a directed network design problem. In IPCO, 1999.]]"},{"key":"e_1_3_2_1_17_1","volume-title":"Manuscript","author":"Nagarajan Viswanath","year":"2007","unstructured":"Viswanath Nagarajan , R. Ravi , and Mohit Singh . A simple proof of Jain\u2019s 2-approximation algorithm for Steiner Network . Manuscript , 2007 .]] Viswanath Nagarajan, R. Ravi, and Mohit Singh. A simple proof of Jain\u2019s 2-approximation algorithm for Steiner Network. Manuscript, 2007.]]"},{"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.1145\/1250790.1250887"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Victoria British Columbia Canada","acronym":"STOC '08"},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374486","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:50Z","timestamp":1750255070000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":19,"alternative-id":["10.1145\/1374376.1374486","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374486","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}