{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T12:38:35Z","timestamp":1697632715708},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,15]],"date-time":"2006-12-15T00:00:00Z","timestamp":1166140800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,3,12]]},"DOI":"10.1007\/s10107-006-0061-9","type":"journal-article","created":{"date-parts":[[2006,12,14]],"date-time":"2006-12-14T13:10:45Z","timestamp":1166101845000},"page":"111-144","source":"Crossref","is-referenced-by-count":3,"title":["On the L\u221e-norm of extreme points for crossing supermodular directed network LPs"],"prefix":"10.1007","volume":"110","author":[{"given":"Harold N.","family":"Gabow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,15]]},"reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Vempala, S.: Edge covers of setpairs and the iterative rounding method. In:Proc. 8th International Integer Programming and Combinatorial Optimization Conf., pp. 30\u201344 (2001)","DOI":"10.1007\/3-540-45535-3_3"},{"key":"61_CR2","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimum-cost k-vertex connected subgraphs. In:Proc. 34th Annual ACM Symp. on Theory of Comput., pp. 306\u2013312 (2002)","DOI":"10.1145\/509907.509955"},{"key":"61_CR3","first-page":"63","volume":"41","author":"A. Frank","year":"1979","unstructured":"Frank A. (1979). Kernel systems of directed graphs. Acta Sci. Math., Szeged, Hungary 41: 63\u201376","journal-title":"Acta Sci. Math., Szeged, Hungary"},{"key":"61_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(93)90158-P","volume":"111","author":"A. Frank","year":"1993","unstructured":"Frank A. (1993). Submodular functions in graph theory. Discrete Math. 111: 231\u2013243","journal-title":"Discrete Math."},{"key":"61_CR5","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson G.N. and Ja\u2019Ja\u2019 J. (1981). Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10: 270\u2013283","journal-title":"SIAM J. Comput."},{"key":"#cr-split#-61_CR6.1","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, submitted for publication; union of An iterative rounding 2-approximation algorithm for the element connectivity problem. In: Proc. 42nd Annual IEEE Symp. on Foundations of Comp. Sci., pp. 339\u2013347 (2001);","DOI":"10.1109\/SFCS.2001.959908"},{"key":"#cr-split#-61_CR6.2","doi-asserted-by":"crossref","unstructured":"A 2-approximation for minimum cost {0,1,2} vertex connectivity. In: Proc. 8th International Integer Programming and Combinatorial Optimization Conf., pp. 115\u2013129 (2001)","DOI":"10.1007\/3-540-45535-3_10"},{"key":"61_CR7","unstructured":"Gabow, H.N., Goemans, M. X., Tardos, E., Williamson, D.P.: Approximating the smallest k-edge connected spanning subgraph by LP-rounding. In: Proc. 16th Annual ACM-SIAM Symp. on Disc. Algorithms, pp. 562\u2013571 (2005)"},{"key":"61_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain K. (2001). A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21: 39\u201360","journal-title":"Combinatorica"},{"key":"61_CR9","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller S. and Vishkin U. (1994). Biconnectivity approximations and graph carvings. J. ACM 41: 214\u2013235","journal-title":"J. ACM"},{"key":"61_CR10","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Nutov, Z.: Approximation algorithm for k-node connected subgraphs via critical graphs. In:Proc. 36th Annual ACM Symp. on Theory of Comput., pp. 138\u2013145 (2004)","DOI":"10.1145\/1007352.1007381"},{"key":"61_CR11","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1002\/net.20005","volume":"43","author":"V. Melkonian","year":"2004","unstructured":"Melkonian V. and Tardos E. (2004). Algorithms for a network design problem with crossing supermodular demands. Networks 43: 256\u2013265","journal-title":"Networks"},{"key":"61_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver A. (2003). Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin Heidelberg New York"},{"key":"61_CR13","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani V.V. (2001). Approximation Algorithms. Springer, Berlin Heidelberg New York"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0061-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0061-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0061-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:01Z","timestamp":1559123401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0061-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,15]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,12]]}},"alternative-id":["61"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0061-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,15]]}}}