{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:30Z","timestamp":1725793830224},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_31","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T07:50:30Z","timestamp":1400313030000},"page":"369-380","source":"Crossref","is-referenced-by-count":2,"title":["A Unified Algorithm for Degree Bounded Survivable Network Design"],"prefix":"10.1007","author":[{"given":"Lap Chi","family":"Lau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","first-page":"1413","volume":"29","author":"N. Bansal","year":"2009","unstructured":"Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree bounded directed network design. SIAM Journal on Computing\u00a029, 1413\u20131431 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Vegh, L.: Approximating minimum-cost k-node connected subgraphs via independence-free graphs. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2013)","DOI":"10.1109\/FOCS.2013.12"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00493-006-0016-z","volume":"26","author":"J. Cheriyan","year":"2006","unstructured":"Cheriyan, J., Vempala, S., Vetta, A.: Network design via iterative rounding of setpair relaxations. Combinatorica\u00a026(3), 255\u2013275 (2006)","journal-title":"Combinatorica"},{"issue":"5","key":"31_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."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Fukunaga, T., Ravi, R.: Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 263\u2013272 (2012)","DOI":"10.1109\/FOCS.2012.30"},{"issue":"3","key":"31_CR6","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. of Algorithms\u00a017(3), 409\u2013423 (1994)","journal-title":"J. of Algorithms"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/11496915_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"H.N. Gabow","year":"2005","unstructured":"Gabow, H.N.: On the L \u2009\u221e\u2009-norm of extreme points for crossing supermodular directed network LPs. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 392\u2013406. Springer, Heidelberg (2005)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Goemans, M.X.: Minimum Bounded-Degree Spanning Trees. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 273\u2013282 (2006)","DOI":"10.1109\/FOCS.2006.48"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2-approximation algorithm for the generalized steiner network problem. Combinatorica\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"issue":"5","key":"31_CR10","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.jcss.2013.01.019","volume":"79","author":"R. Khandekar","year":"2013","unstructured":"Khandekar, R., Kortsarz, G., Nutov, Z.: On some network design problems with degree constraints. Journal of Computer and System Sciences\u00a079(5), 725\u2013736 (2013)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-68891-4_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"T. Kir\u00e1ly","year":"2008","unstructured":"Kir\u00e1ly, T., Lau, L.C., Singh, M.: Degree Bounded Matroids and Submodular Flows. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol.\u00a05035, pp. 259\u2013272. Springer, Heidelberg (2008)"},{"issue":"3","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1137\/070700620","volume":"39","author":"L.C. Lau","year":"2009","unstructured":"Lau, L.C., Naor, S., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. SIAM Journal on Computing\u00a039(3), 1062\u20131087 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511977152"},{"issue":"6","key":"31_CR14","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1137\/110854461","volume":"42","author":"L.C. Lau","year":"2014","unstructured":"Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. SIAM Journal on Computing\u00a042(6), 2217\u20132242 (2014)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Louis, A., Vishnoi, N.K.: Improved algorithm for degree bounded survivable network design problem. In: Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory, pp. 408\u2013419 (2010)","DOI":"10.1007\/978-3-642-13731-0_38"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Nutov, Z.: Degree-constrained node-connectivity. In: Proceedings of the 10th Latin American Symposium on Theoretical Informatics (LATIN), pp. 582\u2013593 (2012)","DOI":"10.1007\/978-3-642-29344-3_49"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the 39th ACM Symposium on Theory of Computing (STOC), pp. 661\u2013670 (2007)","DOI":"10.1145\/1250790.1250887"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T02:16:51Z","timestamp":1689214611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}