{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:06:22Z","timestamp":1787508382549,"version":"build-2736575974"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,1,14]],"date-time":"2015-01-14T00:00:00Z","timestamp":1421193600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10107-015-0858-5","type":"journal-article","created":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T11:23:17Z","timestamp":1421148197000},"page":"515-532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A unified algorithm for degree bounded survivable network design"],"prefix":"10.1007","volume":"154","author":[{"given":"Lap Chi","family":"Lau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,1,14]]},"reference":[{"key":"858_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 J. Comput. 29, 1413\u20131431 (2009)","journal-title":"SIAM J. Comput."},{"key":"858_CR2","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Vegh, L.: Approximating minimum-cost $$k$$ 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":"858_CR3","doi-asserted-by":"crossref","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 26(3), 255\u2013275 (2006)","journal-title":"Combinatorica"},{"issue":"5","key":"858_CR4","doi-asserted-by":"crossref","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. 72(5), 838\u2013867 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"858_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":"858_CR6","doi-asserted-by":"crossref","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 17(3), 409\u2013423 (1994)","journal-title":"J. Algorithms"},{"key":"858_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.: On the $$L_\\infty $$ L \u221e -norm of extreme points for crossing supermodular directed network LPs. In: Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 392\u2013406 (2005)","DOI":"10.1007\/11496915_29"},{"key":"858_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":"858_CR9","doi-asserted-by":"crossref","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 21(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"issue":"5","key":"858_CR10","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 79(5), 725\u2013736 (2013)","journal-title":"J. Comput. Syst. Sci."},{"key":"858_CR11","doi-asserted-by":"crossref","unstructured":"Kir\u00e1ly, T., Lau, L.C., Singh, M.: Degree bounded matroids and submodular flows. In: Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 259\u2013272 (2008)","DOI":"10.1007\/978-3-540-68891-4_18"},{"issue":"3","key":"858_CR12","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1137\/070700620","volume":"39","author":"LC Lau","year":"2009","unstructured":"Lau, L.C., Naor, S., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. SIAM J. Comput. 39(3), 1062\u20131087 (2009)","journal-title":"SIAM J. Comput."},{"key":"858_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511977152","volume-title":"Iterative Methods in Combinatorial Optimization","author":"LC Lau","year":"2011","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge University Press, New York (2011)"},{"key":"858_CR14","doi-asserted-by":"crossref","unstructured":"Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. SIAM J. Comput. 42(6), 2217\u20132242 (2013)","DOI":"10.1137\/110854461"},{"key":"858_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":"858_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":"858_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":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0858-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0858-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0858-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:06Z","timestamp":1559109606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0858-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,14]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["858"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0858-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,14]]}}}