{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:55:11Z","timestamp":1787507711832,"version":"build-2736575974"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T00:00:00Z","timestamp":1488153600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10107-017-1126-7","type":"journal-article","created":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T10:58:25Z","timestamp":1488193105000},"page":"293-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Chain-constrained spanning trees"],"prefix":"10.1007","volume":"167","author":[{"given":"Neil","family":"Olver","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,2,27]]},"reference":[{"key":"1126_CR1","unstructured":"Anari, N., Oveis Gharan, S.: Effective-resistance-reducing flows and asymmetric TSP. ArXiv:1411.4613 (2014)"},{"key":"1126_CR2","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Goemans, M.X., Madry, A., Oveis Gharan, S., Saberi, A.: An $$O(\\log n \/ \\log \\log n)$$ O ( log n \/ log log n ) -approximation algrithm for the asymmetric traveling salesman problem. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2010)","DOI":"10.1137\/1.9781611973075.32"},{"key":"1126_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, N., Khandekar, R., K\u00f6nemann, J., Nagarajan, V., Peis, B.: On generalizations of network design problems with degree bounds. Math. Program. 141(1), 479\u2013506 (2013). doi: 10.1007\/s10107-012-0537-8","DOI":"10.1007\/s10107-012-0537-8"},{"issue":"4","key":"1126_CR4","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1137\/080734340","volume":"39","author":"N Bansal","year":"2009","unstructured":"Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree-bounded directed network design. SIAM J. Comput. 39(4), 1413\u20131431 (2009)","journal-title":"SIAM J. Comput."},{"key":"1126_CR5","doi-asserted-by":"crossref","unstructured":"Bauer, F., Varma, A.: Degree-constrained multicasting in point-to-point networks. In: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), pp. 369\u2013376 (1995)","DOI":"10.1109\/INFCOM.1995.515897"},{"key":"1126_CR6","doi-asserted-by":"crossref","first-page":"4489","DOI":"10.1016\/j.tcs.2009.07.029","volume":"410","author":"K Chaudhuri","year":"2009","unstructured":"Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids. Theor. Comput. Sci. 410, 4489\u20134503 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1126_CR7","doi-asserted-by":"crossref","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 55, 157\u2013189 (2009)","journal-title":"Algorithmica"},{"key":"1126_CR8","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: Proceedings of the 51st IEEE Symposium on Foundations of Computer Science (FOCS), pp 575\u2013584 (2010)","DOI":"10.1109\/FOCS.2010.60"},{"issue":"3","key":"1126_CR9","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":"1126_CR10","doi-asserted-by":"crossref","unstructured":"Goemans, M.X.: Minimum bounded degree spanning trees. In: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 273\u2013282 (2006)","DOI":"10.1109\/FOCS.2006.48"},{"key":"1126_CR11","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, 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"1126_CR12","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1137\/S009753970036917X","volume":"31","author":"J K\u00f6nemann","year":"2002","unstructured":"K\u00f6nemann, J., Ravi, R.: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. SIAM J. Comput. 31, 1783\u20131793 (2002)","journal-title":"SIAM J. Comput."},{"key":"1126_CR13","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual meets local search: approximating MST\u2019s with nonuniform degree bounds. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 389\u2013395 (2003)","DOI":"10.1145\/780542.780600"},{"key":"1126_CR14","doi-asserted-by":"crossref","unstructured":"Linhares, A., Swamy, C.: Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems. In Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO). Springer-Verlag, New York, pp. 38\u201349 (2016)","DOI":"10.1007\/978-3-319-33461-5_4"},{"key":"1126_CR15","doi-asserted-by":"crossref","unstructured":"Oveis Gharan, S., Saberi, A.: The asymmetric traveling salesman problem on graphs with bounded genus. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 967\u2013975 (2011)","DOI":"10.1137\/1.9781611973082.75"},{"issue":"1","key":"1126_CR16","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s00453-001-0038-2","volume":"31","author":"R Ravi","year":"2001","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 31(1), 58\u201378 (2001)","journal-title":"Algorithmica"},{"key":"1126_CR17","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"1126_CR18","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 Annual ACM Symposium on Theory of Computing (STOC), pp. 661\u2013670 (2007)","DOI":"10.1145\/1250790.1250887"},{"key":"1126_CR19","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: Matroidal degree-bounded minimum spanning trees. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1512\u20131521 (2012)","DOI":"10.1137\/1.9781611973099.120"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1126-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1126-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1126-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T00:23:04Z","timestamp":1568852584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1126-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,27]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["1126"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1126-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,27]]}}}