Abstract
This paper presents approximation algorithms for two problems. First, a randomized algorithm guaranteeing approximation ratio √n with high probability is proposed for the Max-Rep problem of [Kor98], or the Label-CoverMAX problem (cf. [Hoc95]), where n is the number of vertices in the graph. This algorithm is then generalized into a 4√n-ratio algorithm for the nonuniform version of the problem. Secondly, it is shown that the Red-Blue Set Cover problem of [CDKM00] can be approximated with ratio 2√nlogβ, where n is the number of sets andβ is the number of blue elements. Both algorithms can be adapted to the weighted variants of the respective problems, yielding the same approximation ratios.
Supported in part by a grant from the Israel Ministry of Science and Art.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Alekhnovich, S. Buss, S. Moran, and T. Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. Manuscript, 1998.
S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes and linear equations. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 724–733, 1993.
Robert Carr, Srinivas Doddi, Goran Konjevod, and Madhav Marathe. On the red-blue set cover problem. In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000.
V. Chvatal. A greedy heuristic for the set-covering problem. Math. of Oper. Res., 4:233–235, 1979.
I. Dinur and S. Safra. On the hardness of approximating label cover. Technical Report 15, Electronic Colloquium on Computational Complexity, 1999.
Michael Elkin and David Peleg. The hardness of approximating spanner problems. In Proc. 17th Symp. on Theoretical Aspects of Computer Science, pages 370–381, February 2000.
Michael H. Goldwasser and Rajeev Motwani. Intractability of assembly sequencing: Unit disks in the plane. In Proc. Workshop on Algorithms and Data Structures, volume LNCS 1272, pages 307–320. Springer-Verlag, 1997.
Y. Hassin. Private communication, 2000.
Dorit S. Hochbaum. Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston, MA, 1995.
G. Kortsarz. On the hardness of approximating spanners. In Proc. 1st Int. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 135–146. Springer-Verlag, 1998. LNCS 1444.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (2000). Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-44985-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67690-4
Online ISBN: 978-3-540-44985-0
eBook Packages: Springer Book Archive