{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:21:07Z","timestamp":1769973667180,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1016684"],"award-info":[{"award-number":["CCF-1016684"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Siebel Scholar award"},{"name":"Chirag Foundation graduate fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591837","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"754-763","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements"],"prefix":"10.1145","author":[{"given":"Alina","family":"Ene","sequence":"first","affiliation":[{"name":"Princeton University and University of Warwick"}]},{"given":"Ali","family":"Vakilian","sequence":"additional","affiliation":[{"name":"CSAIL, MIT"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Discrete Optimization","author":"Aazami A.","year":"2012"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"J Cheriyan and L. V\u00e9gh. Approximating minimum-cost k-node connected subgraphs via independence-free graphs. arXiv preprint arXiv:1212.3981 2012.  J Cheriyan and L. V\u00e9gh. Approximating minimum-cost k-node connected subgraphs via independence-free graphs. arXiv preprint arXiv:1212.3981 2012.","DOI":"10.1109\/FOCS.2013.12"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.12"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a018"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.006"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.03.040"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"A. Frank and \u00c9. Tardos. An application of submodular ows. Linear algebra and its applications 114:329--348 1989.  A. Frank and \u00c9. Tardos. An application of submodular ows. Linear algebra and its applications 114:329--348 1989.","DOI":"10.1016\/0024-3795(89)90469-2"},{"key":"e_1_3_2_2_8_1","first-page":"159","volume-title":"8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications","author":"Fukunaga T.","year":"2013"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"T. Fukunaga Z. Nutov and R. Ravi. Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. ArXiv e-prints 2013.  T. Fukunaga Z. Nutov and R. Ravi. Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. ArXiv e-prints 2013.","DOI":"10.1109\/FOCS.2012.30"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.30"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.48"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796444"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335371"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702418048"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/070700620"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2018773"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374485"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_38"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29344-3_49"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250887"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01299747"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","location":"New York New York","acronym":"STOC '14","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591837","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":22,"alternative-id":["10.1145\/2591796.2591837","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591837","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}