{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:09:23Z","timestamp":1761401363217,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"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.1250886","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"651-660","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Survivable network design with degree or order constraints"],"prefix":"10.1145","author":[{"given":"Lap Chi","family":"Lau","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Mohammad R.","family":"Salavatipour","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, Canada"}]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979528826X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1542"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_3"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of ICALP","author":"Chaudhuri K.","year":"2006","unstructured":"{4} K. Chaudhuri , S. Rao , S. Riesenfeld , and K. Talwar . Push relabel and an improved approximation algorithm for the bounded-degree mst problem , In Proc. of ICALP 2006 . {4} K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar. Push relabel and an improved approximation algorithm for the bounded-degree mst problem , In Proc. of ICALP 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0016-z"},{"key":"e_1_3_2_1_6_1","volume-title":"ECCC report 41","author":"Feder T.","year":"2006","unstructured":"{6} T. Feder , R. Motwani , and A. Zhu , k-Connected spanning subgraphs of low degree , ECCC report 41 , 2006 . {6} T. Feder, R. Motwani, and A. Zhu, k-Connected spanning subgraphs of low degree, ECCC report 41, 2006."},{"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","first-page":"274","volume-title":"Proc. of the 28th Annual Allerton Conf. on Commun., Control and Computing","author":"F\u00fcrer M.","year":"1990","unstructured":"{8} M. F\u00fcrer and B. Raghavachari , An NC approximation algorithm for the minimum degree spanning tree problem , In Proc. of the 28th Annual Allerton Conf. on Commun., Control and Computing , pages 274 - 281 , 1990 . {8} M. F\u00fcrer and B. Raghavachari, An NC approximation algorithm for the minimum degree spanning tree problem, In Proc. of the 28th Annual Allerton Conf. on Commun., Control and Computing, pages 274-281, 1990."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_1_11_1","series-title":"Acta Sci. Math (Szeged)","first-page":"63","volume-title":"Kernel Systems of Directed Graphs","author":"Frank A.","year":"1979","unstructured":"{11} A. Frank , Kernel Systems of Directed Graphs , Acta Sci. Math (Szeged) 41 : 63 - 76 , 1979 . {11} A. Frank, Kernel Systems of Directed Graphs, Acta Sci. Math (Szeged) 41:63-76, 1979."},{"key":"e_1_3_2_1_12_1","first-page":"302","volume-title":"Proc. of the 37th IEEE FOCS","author":"Garg N.","year":"1996","unstructured":"{12} N. Garg , A 3-Approximation for the minim tree spanning k vertices , In Proc. of the 37th IEEE FOCS , 302 - 309 , 1996 . {12} N. Garg, A 3-Approximation for the minim tree spanning k vertices, In Proc. of the 37th IEEE FOCS, 302-309, 1996."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060650"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.48"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_16"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930170004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v44:3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24597-1_25"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970036917X"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702418048"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416736"},{"key":"e_1_3_2_1_24_1","volume-title":"Survey","author":"Kortsarz G.","year":"2006","unstructured":"{24} G. Kortsarz and Z. Nutov , Approximating min-cost connectivity problems , Survey Chapter in Approximation Algorithms and Metaheuristics, Editor T.F. Gonzalez , 2006 . {24} G. Kortsarz and Z. Nutov, Approximating min-cost connectivity problems, Survey Chapter in Approximation Algorithms and Metaheuristics, Editor T.F. Gonzalez, 2006."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.414"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v43:4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167209"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194266331"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0038-2"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/646830.707571"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_16"},{"key":"e_1_3_2_1_32_1","volume-title":"Combinatorial Optimization - Polyhedra and Efficiency","author":"Schrijver A.","year":"2005","unstructured":"{32} A. Schrijver , Combinatorial Optimization - Polyhedra and Efficiency , Springer-Verlag , New York , 2005 . Approximation. {32} A. Schrijver, Combinatorial Optimization - Polyhedra and Efficiency, Springer-Verlag, New York, 2005. Approximation."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250887"},{"key":"e_1_3_2_1_34_1","volume-title":"Approximation Algorithms","author":"Vazirani V.","year":"2001","unstructured":"{34} V. Vazirani , Approximation Algorithms , Springer , 2001 . {34} V. Vazirani, Approximation Algorithms, Springer, 2001."}],"event":{"name":"STOC07: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego California USA","acronym":"STOC07"},"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.1250886","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250790.1250886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:47Z","timestamp":1750258067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250790.1250886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":34,"alternative-id":["10.1145\/1250790.1250886","10.1145\/1250790"],"URL":"https:\/\/doi.org\/10.1145\/1250790.1250886","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"}}]}}