{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:39Z","timestamp":1725470739377},"publisher-location":"Berlin, Heidelberg","reference-count":32,"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_43","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"468-479","source":"Crossref","is-referenced-by-count":12,"title":["A Unified Approach to Approximating Partial Covering Problems"],"prefix":"10.1007","author":[{"given":"Jochen","family":"K\u00f6nemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ojas","family":"Parekh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 577\u2013586 (2004)"},{"issue":"4","key":"43_CR2","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E., Padberg, M.: Set partitioning: A survey. SIAM Review\u00a018(4), 710\u2013760 (1976)","journal-title":"SIAM Review"},{"issue":"2","key":"43_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R. Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. Journal of Algorithms\u00a039(2), 137\u2013144 (2001)","journal-title":"Journal of Algorithms"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Bshouty, N.H., Burroughs, L.: Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 298\u2013308 (1998)","DOI":"10.1007\/BFb0028569"},{"key":"43_CR5","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: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pp. 144\u2013153 (2005)","DOI":"10.1109\/CCC.2005.20"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10107-003-0479-2","volume":"100","author":"F.A. Chudak","year":"2004","unstructured":"Chudak, F.A., Roughgarden, T., Williamson, D.P.: Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Mathematical Programming\u00a0100(2), 411\u2013421 (2004)","journal-title":"Mathematical Programming"},{"key":"43_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1997","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial Optimization. John Wiley and Sons, New York (1997)"},{"key":"43_CR8","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":"43_CR9","doi-asserted-by":"crossref","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: Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 90\u2013101 (2001)","DOI":"10.1007\/3-540-44666-4_13"},{"issue":"4","key":"43_CR10","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":"4","key":"43_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0167-6377(99)00045-0","volume":"25","author":"T. Fujito","year":"1999","unstructured":"Fujito, T.: On approximation of the submodular set cover problem. Operations Research Letters\u00a025(4), 169\u2013174 (1999)","journal-title":"Operations Research Letters"},{"issue":"1","key":"43_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R. Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. Journal of Algorithms\u00a053(1), 55\u201384 (2004)","journal-title":"Journal of Algorithms"},{"key":"43_CR13","unstructured":"Garfinkel, R.S., Nemhauser, G.L.: Optimal set covering: A survey. In: Geoffrion, A.M. (ed.) Perspectives on Optimization, pp. 164\u2013183 (1972)"},{"issue":"2","key":"43_CR14","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":"43_CR15","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":"1","key":"43_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jagm.2002.1221","volume":"43","author":"D.R. Gaur","year":"2002","unstructured":"Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. Journal of Algorithms\u00a043(1), 138\u2013152 (2002)","journal-title":"Journal of Algorithms"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Golovin, D., Nagarajan, V., Singh, M.: Approximating the k-multicut problem. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 621\u2013630 (2006)","DOI":"10.1145\/1109557.1109625"},{"key":"43_CR18","unstructured":"Hochbaum, D.S.: Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, ch. 3, pp. 94\u2013143. PWS Publishing Company (1997)"},{"key":"43_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0053968","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"D.S. Hochbaum","year":"1998","unstructured":"Hochbaum, D.S.: The t-vertex cover problem: Extending the half integrality framework with budget constraints. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol.\u00a01444, pp. 111\u2013122. Springer, Heidelberg (1998)"},{"issue":"3","key":"43_CR20","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(3), 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR21","volume-title":"The Computational Complexity of Machine Learning","author":"M.J. Kearns","year":"1990","unstructured":"Kearns, M.J.: The Computational Complexity of Machine Learning. MIT Press, Cambridge (1990)"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"key":"43_CR23","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Parekh, O., Segev, D.: A unified approach to approximating partial covering problems (2006), available at: http:\/\/www.math.tau.ac.il\/~segevd","DOI":"10.1007\/11841036_43"},{"key":"43_CR24","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":"43_CR25","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":"43_CR26","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"},{"issue":"1","key":"43_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(02)00218-4","volume":"126","author":"H. Nagamochi","year":"2003","unstructured":"Nagamochi, H.: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discrete Applied Mathematics\u00a0126(1), 83\u2013113 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"43_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0167-5060(08)70831-8","volume":"4","author":"M.W. Padberg","year":"1979","unstructured":"Padberg, M.W.: Covering, packing and knapsack problems. Annals of Discrete Mathematics\u00a04, 265\u2013287 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"43_CR29","unstructured":"Parekh, O.: Polyhedral Techniques for Graphic Covering Problems. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University (2002)"},{"issue":"2\u20133","key":"43_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0166-218X(99)00052-9","volume":"92","author":"J. Plesn\u00edk","year":"1999","unstructured":"Plesn\u00edk, J.: Constrained weighted matchings and edge coverings in graphs. Discrete Applied Mathematics\u00a092(2\u20133), 229\u2013241 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"43_CR31","unstructured":"R\u00e4cke, H.: Minimizing congestion in general networks. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 43\u201352 (2002)"},{"issue":"5","key":"43_CR32","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(97)00182-8","volume":"64","author":"P. Slav\u00edk","year":"1997","unstructured":"Slav\u00edk, P.: Improved performance of the greedy algorithm for partial cover. Information Processing Letters\u00a064(5), 251\u2013254 (1997)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:31Z","timestamp":1605642031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11841036_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}