{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:16:53Z","timestamp":1742383013344},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647362"},{"type":"electronic","value":"9783540690672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053965","type":"book-chapter","created":{"date-parts":[[2006,7,26]],"date-time":"2006-07-26T17:42:59Z","timestamp":1153935779000},"page":"77-88","source":"Crossref","is-referenced-by-count":3,"title":["Approximating k-outconnected subgraph problems"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Cheriyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1137\/0403027","volume":"3","author":"D. Bienstock","year":"1990","unstructured":"D. Bienstock, E. F. Brickell and C. L. Monma, \u201cOn the structure of minimum-weight k-connected spanning networks,\u201d SIAM J. Discrete Math.\n                3 (1990), 320\u2013329.","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR2","volume-title":"Extremal Graph Theory","author":"B. Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s, Extremal Graph Theory, Academic Press, London, 1978."},{"key":"7_CR3","unstructured":"J.Cheriyan and R.Thurimella, \u201cApproximating minimum-size k-connected spanning subgraphs via matching,\u201d manuscript, Sept. 1996. ECCC TR98-025, see http:\/\/www.eccc.uni-trier.de\/eccc-local\/Lists\/TR-1998.html. Preliminary version in Proc. 37th IEEE FOCS (1996), 292\u2013301."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0024-3795(89)90469-2","volume":"114\/115","author":"A. Frank","year":"1989","unstructured":"A.Frank and E. Tardos, \u201cAn application of submodular flows,\u201d Linear Algebra and its Applications, 114\/115 (1989), 320\u2013348.","journal-title":"Linear Algebra and its Applications"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","volume":"19","author":"G.L. Frederickson","year":"1982","unstructured":"G.L.Frederickson and J. Ja'Ja', \u201cOn the relationship between the biconnectivity augmentation and traveling salesman problems,\u201d Theor. Comp. Sci.\n                19 (1982), 189\u2013201.","journal-title":"Theor. Comp. Sci."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H. N. Gabow","year":"1991","unstructured":"H. N. Gabow and R. E. Tarjan, \u201cFaster scaling algorithms for general graph matching problems,\u201d Journal of the ACM\n                38 (1991), 815\u2013853.","journal-title":"Journal of the ACM"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1006\/jctb.1995.1002","volume":"63","author":"T. Jord\u00e1n","year":"1995","unstructured":"T. Jord\u00e1n, \u201cOn the optimal vertex-connectivity augmentation,\u201d J. Combinatorial Theory, Series B\n                63 (1995), 8\u201320.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"7_CR8","volume-title":"Approximation algorithms for NP-hard problems","author":"S. Khuller","year":"1996","unstructured":"S. Khuller, \u201cApproximation algorithms for finding highly connected subgraphs,\u201d in Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS publishing co., Boston, 1996."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1006\/jagm.1996.0052","volume":"21","author":"S. Khuller","year":"1996","unstructured":"S. Khuller and B. Raghavachari, \u201cImproved approximation algorithms for uniform connectivity problems,\u201d Journal of Algorithms\n                21 (1996), 434\u2013450.","journal-title":"Journal of Algorithms"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01304873","volume":"23","author":"W. Mader","year":"1972","unstructured":"W. Mader, \u201cEcken vom Grad n in minimalen n-fach zusammenh\u00c4ngenden Graphen,\u201d Archive der Mathematik\n                23 (1972), 219\u2013224.","journal-title":"Archive der Mathematik"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"H.Nagamochi and T.Ibaraki, \u201cA linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph,\u201d Algorithmica\n                7 (1992), 583\u2013596.","journal-title":"Algorithmica"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/03155986.1997.11732329","volume":"35","author":"Z. Nutov","year":"1997","unstructured":"Z.Nutov, M.Penn and D.Sinreich, \u201cOn mobile robots flow in locally uniform networks,\u201d Canadian Journal of Information Systems and Operational Research\n                35 (1997), 197\u2013208.","journal-title":"Canadian Journal of Information Systems and Operational Research"},{"key":"7_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02523686","volume":"18","author":"R. Ravi","year":"1997","unstructured":"R. Ravi and D. P. Williamson, \u201cAn approximation algorithm for minimum-cost vertex-connectivity problems.\u201d Algorithmica (1997) 18: 21\u201343.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatiorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T12:13:16Z","timestamp":1549887196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647362","9783540690672"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0053965","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}