{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:26Z","timestamp":1759638866165},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662518"},{"type":"electronic","value":"9783540484813"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48481-7_44","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T19:49:40Z","timestamp":1193514580000},"page":"510-520","source":"Crossref","is-referenced-by-count":26,"title":["On 2-Coverings and 2-Packings of Laminar Families"],"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":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"44_CR1","volume-title":"Combinatorial Optimization","author":"W. J. Cook","year":"1998","unstructured":"W. J. Cook, W. H. Cunningham, W. R. Pulleyblank, and A. Schrijver, Combinatorial Optimization, JohnWiley & Sons, NewYork, 1998."},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. Eswaran","year":"1976","unstructured":"K. Eswaran and R. E. Tarjan, \u201cAugmentation problems,\u201d SIAM J. Computing\n                        5 (1976), 653\u2013665.","journal-title":"SIAM J. Computing"},{"key":"44_CR3","first-page":"34","volume-title":"Mathematical Programming: State of the Art 1994","author":"A. Frank","year":"1994","unstructured":"A. Frank, \u201cConnectivity augmentation problems in network design,\u201d in Mathematical Programming: State of the Art 1994, (Eds. J. R. Birge and K. G. Murty), The University of Michigan, Ann Arbor, MI, 1994, 34\u201363."},{"key":"44_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G. N. Frederickson","year":"1981","unstructured":"G. N. Frederickson and J. Ja\u2019Ja\u2019, \u201cApproximation algorithms for several graph augmentation problems,\u201d SIAM J. Comput.\n                        10 (1981), 270\u2013283.","journal-title":"SIAM J. Comput."},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"N. Garg, M. Yannakakis, and V. Vazirani, \u201cPrimal-dual approximation algorithms for integral flow and multicut in trees,\u201d Algorithmica\n                        18 (1997), 3\u201320.","journal-title":"Algorithmica"},{"key":"44_CR6","volume-title":"Approximation algorithms for NP-hard problems","author":"D. S. Hochbaum","year":"1996","unstructured":"D. S. Hochbaum, \u201cApproximating covering and packing problems: set cover, vertex cover, independent set, and related problems,\u201d in Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS co., Boston, 1996."},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"K. Jain, \u201cA factor 2 approximation algorithm for the generalized Steiner network problem,\u201d Proc. 39th IEEE FOCS, Palo Alto, CA, November 1998.","DOI":"10.1109\/SFCS.1998.743495"},{"key":"44_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":"44_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"S. Khuller and U. Vishkin, \u201cBiconnectivity approximations and graph carvings,\u201d Journal of the ACM\n                        41 (1994), 214\u2013235.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48481-7_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:50:55Z","timestamp":1551016255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48481-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662518","9783540484813"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48481-7_44","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}