{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:36Z","timestamp":1725558396195},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_38","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"408-419","source":"Crossref","is-referenced-by-count":8,"title":["Improved Algorithm for Degree Bounded Survivable Network Design Problem"],"prefix":"10.1007","author":[{"given":"Anand","family":"Louis","sequence":"first","affiliation":[]},{"given":"Nisheeth K.","family":"Vishnoi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree bounded directed network design. In: STOC, pp. 769\u2013778 (2008)","DOI":"10.1145\/1374376.1374486"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Chan, Y.H., Fung, W.S., Lau, L.C., Yung, C.K.: Degree bounded network design with metric costs. In: FOCS, pp. 125\u2013134 (2008)","DOI":"10.1109\/FOCS.2008.28"},{"issue":"1","key":"38_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00453-007-9115-5","volume":"55","author":"K. Chaudhuri","year":"2009","unstructured":"Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would edmonds do? augmenting paths and witnesses for degree-bounded msts. Algorithmica\u00a055(1), 157\u2013189 (2009)","journal-title":"Algorithmica"},{"issue":"5","key":"38_CR4","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.jcss.2005.05.006","volume":"72","author":"L. Fleischer","year":"2006","unstructured":"Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci.\u00a072(5), 838\u2013867 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"38_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M. F\u00fcrer","year":"1994","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the minimum-degree steiner tree to within one of optimal. J. Algorithms\u00a017(3), 409\u2013423 (1994)","journal-title":"J. Algorithms"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Goemans, M.X.: Minimum bounded degree spanning trees. In: FOCS, pp. 273\u2013282 (2006)","DOI":"10.1109\/FOCS.2006.48"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01580607","volume":"60","author":"M.X. Goemans","year":"1993","unstructured":"Goemans, M.X., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program.\u00a060, 145\u2013166 (1993)","journal-title":"Math. Program."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Jain, K.: Factor 2 approximation algorithm for the generalized steiner network problem. In: FOCS, pp. 448\u2013457 (1998)","DOI":"10.1109\/SFCS.1998.743495"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Kir\u00e1ly, T., Lau, L.C., Singh, M.: Degree bounded matroids and submodular flows. In: IPCO, pp. 259\u2013272 (2008)","DOI":"10.1007\/978-3-540-68891-4_18"},{"issue":"3","key":"38_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/net.20031","volume":"44","author":"P.N. Klein","year":"2004","unstructured":"Klein, P.N., Krishnan, R., Raghavachari, B., Ravi, R.: Approximation algorithms for finding low-degree subgraphs. Networks\u00a044(3), 203\u2013215 (2004)","journal-title":"Networks"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In: STOC, pp. 537\u2013546 (2000)","DOI":"10.1145\/335305.335371"},{"key":"38_CR12","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/1250790.1250886","volume-title":"STOC","author":"L.C. Lau","year":"2007","unstructured":"Lau, L.C., Naor, J., Salavatipour, M.R., Singh, M.: Survivable network design with degree or order constraints. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 651\u2013660. ACM, New York (2007)"},{"key":"38_CR13","first-page":"759","volume-title":"STOC","author":"L.C. Lau","year":"2008","unstructured":"Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. In: Ladner, R.E., Dwork, C. (eds.) STOC, pp. 759\u2013768. ACM, New York (2008)"},{"key":"38_CR14","unstructured":"Lau, L.C., Singh, M.: Iterative rounding and relaxation. In: RIMS Kokyuroku Bessatsu, Kyoto (2009)"},{"issue":"4","key":"38_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/net.20005","volume":"43","author":"V. Melkonian","year":"2004","unstructured":"Melkonian, V., Tardos, \u00c9.: Algorithms for a network design problem with crossing supermodular demands. Networks\u00a043(4), 256\u2013265 (2004)","journal-title":"Networks"},{"key":"38_CR16","unstructured":"Singh, M.: Iterative methods in combinatorial optimization. PhD Thesis, Tepper School of Business, Carnegie Mellon University (2008)"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC, pp. 661\u2013670 (2007)","DOI":"10.1145\/1250790.1250887"},{"key":"38_CR18","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (March 2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T10:37:03Z","timestamp":1685615823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}