{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:51Z","timestamp":1725470751073},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_51","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"564-575","source":"Crossref","is-referenced-by-count":0,"title":["Path Hitting in Acyclic Graphs"],"prefix":"10.1007","author":[{"given":"Ojas","family":"Parekh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1002\/net.3230130403","volume":"13","author":"J. Ar\u00e1oz","year":"1983","unstructured":"Ar\u00e1oz, J., Cunningham, W.H., Edmonds, J., Green-Kr\u00f3tki, J.: Reductions to 1-matching polyhedra. Networks\u00a013, 455\u2013473 (1983)","journal-title":"Networks"},{"issue":"3","key":"51_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1023\/A:1011445210568","volume":"5","author":"R. Carr","year":"2001","unstructured":"Carr, R., Fujito, T., Konjevod, G., Parekh, O.: A \n                    \n                      \n                    \n                    $2 \\frac{1}{10}$\n                  -approximation algorithm for a generalization of the weighted edge-dominating set problem. Journal of Combinatorial Optimization\u00a05(3), 317\u2013326 (2001)","journal-title":"Journal of Combinatorial Optimization"},{"doi-asserted-by":"crossref","unstructured":"Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y., Sivakumar, D.: On the hardness of approximating multicut and sparsest-cut. In: 20th CCC, pp. 144\u2013153 (2005)","key":"51_CR3","DOI":"10.1109\/CCC.2005.20"},{"key":"51_CR4","first-page":"89","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"Edmonds, J., Johnson, E.L.: Matching: A well-solved class of integer linear programs. In: Combinatorial Structures and their Applications, pp. 89\u201392. Gordon and Breach, New York (1970)"},{"key":"51_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-44666-4_13","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"G. Even","year":"2001","unstructured":"Even, G., Feldman, J., Kortsarz, G., Nutov, Z.: A 3\/2-approximation algorithm for augmenting the edge-connectivity of a graph from 1 to 2 using a subset of a given edge set. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 90\u2013101. Springer, Heidelberg (2001)"},{"issue":"4","key":"51_CR6","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"51_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e1J\u00e1, J.: Approximation algorithm for several graph augmentation problems. SIAM Journal on Computing\u00a010(2), 270\u2013283 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"51_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00383-8","volume":"118","author":"T. Fujito","year":"2002","unstructured":"Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics\u00a0118(3), 199\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"51_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing\u00a025(2), 235\u2013251 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"51_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica\u00a018(1), 3\u201320 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"51_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"51_CR12","doi-asserted-by":"publisher","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\u00a021(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"51_CR14","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S. Khuller","year":"1993","unstructured":"Khuller, S., Thurimella, R.: Approximation algorithms for graph augmentation. Journal of Algorithms\u00a014(2), 214\u2013225 (1993)","journal-title":"Journal of Algorithms"},{"key":"51_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11671411_25","volume-title":"Approximation and Online Algorithms","author":"A. Levin","year":"2006","unstructured":"Levin, A., Segev, D.: Partial multicuts in trees. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 320\u2013333. Springer, Heidelberg (2006)"},{"key":"51_CR16","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"51_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/net.3230120403","volume":"12","author":"K.G. Murty","year":"1982","unstructured":"Murty, K.G., Perin, C.: A 1-matching blossom type algorithm for edge covering problems. Networks\u00a012, 379\u2013391 (1982)","journal-title":"Networks"},{"unstructured":"Parekh, O.: Edge dominating and hypomatchable sets. In: 13th SODA, pp. 287\u2013291 (2002)","key":"51_CR18"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:56Z","timestamp":1619507816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11841036_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}