Algorithmica

, Volume 61, Issue 1, pp 190–206 | Cite as

Improved Approximation Algorithms for Label Cover Problems

  • Moses Charikar
  • MohammadTaghi Hajiaghayi
  • Howard Karloff
Article

Abstract

In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem. So far the best approximation ratios known for these two problems were \(O(\sqrt{n})\) and indeed some authors suggested the possibility that this ratio is the best approximation factor for these two problems. We show, in fact, that there are a O(n1/3)-approximation algorithm for Max Rep and a O(n1/3log 2/3n)-approximation algorithm for Min Rep. In addition, we also exhibit a randomized reduction from Densestk-Subgraph to Max Rep, showing that any approximation factor for Max Rep implies the same factor (up to a constant) for Densestk-Subgraph.

Keywords

Label Cover Approximation algorithm Hardness of approximation Min Rep Max Rep Densest k-Subgraph 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aazami, A., Stilp, M.D.: Approximation algorithms and hardness for domination with propagation. In: The 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 1–15 (2007) CrossRefGoogle Scholar
  2. 2.
    Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54, 317–331 (1997) MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities–an O(n 1/4) approximation for densest k-subgraph. In: Proceedings of the Forty-Second Annual ACM Symposium on Theory of Computing (STOC), pp. 201–210. ACM, New York (2010) Google Scholar
  4. 4.
    Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. In: SODA ’09, 20th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, pp. 932–941 (2009) CrossRefGoogle Scholar
  5. 5.
    Breslau, L., Diakonikolas, I., Duffield, N., Gu, Y., Hajiaghayi, M., Johnson, D., Karloff, H., Resende, M.G.C., Sen, S.: Disjoint-path facility location: theory and practice. In: 2011 ALENEX proceedings, San Francisco, January 22, pp. 60–74. SIAM, Philadelphia (2011) Google Scholar
  6. 6.
    Chen, N.: On the approximability of influence in social networks. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), pp. 1029–1037. Society for Industrial and Applied Mathematics, Philadelphia (2008) Google Scholar
  7. 7.
    Dodis, Y., Khanna, S.: Design networks with bounded pairwise distance. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC), pp. 750–759. ACM, New York (1999) CrossRefGoogle Scholar
  8. 8.
    Elkin, M., Peleg, D.: Strong inapproximability of the basic k-spanner problem. In: Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP), pp. 636–647. Springer, London (2000) CrossRefGoogle Scholar
  9. 9.
    Elkin, M., Peleg, D.: The hardness of approximating spanner problems. Theory Comput. Syst. 41, 691–729 (2007) MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Even, G., Kortsarz, G., Slany, W.: On network design problems: fixed cost flows and the covering Steiner problem. ACM Trans. Algorithms 1, 74–101 (2005) MathSciNetCrossRefGoogle Scholar
  11. 11.
    Feldman, M., Kortsarz, G., Nutov, Z.: Improved approximation for the directed Steiner forest problem. In: Proceedings of the 20th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, Philadelphia (2009) Google Scholar
  12. 12.
    Gupta, A., Hajiaghayi, M., Kumar, A.: Stochastic Steiner tree with nonuniform inflation. In: the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 134–148 (2007) CrossRefGoogle Scholar
  13. 13.
    Hajiaghayi, M.T., Kortsarz, G., Mirrokni, V.S., Nutov, Z.: Power optimization for connectivity problems. Math. Program. 110, 195–208 (2007) MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Hassin, R., Segev, D.: The set cover with pairs problem. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Lecture Notes in Comput. Sci., vol. 3821, pp. 164–176. Springer, Berlin (2005) Google Scholar
  15. 15.
    Hochbaum, D.S. (ed.): Approximation Algorithms for NP-hard Problems. PWS Publishing, Boston (1997). See the section written by Arora and Lund Google Scholar
  16. 16.
    Khot, S.: Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Comput. 36, 1025–1071 (2006) MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Kortsarz, G.: On the hardness of approximating spanners. Algorithmica 30, 432–450 (2001) MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Kortsarz, G., Krauthgamer, R., Lee, J.R.: Hardness of approximation for vertex-connectivity network design problems. SIAM J. Comput. 33, 185–199 (2004) MathSciNetCrossRefGoogle Scholar
  19. 19.
    Peleg, D.: Approximation algorithms for the label—covermax and red-blue set cover problems. J. Discrete Algorithms 5, 55–64 (2007) MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Rohloff, K.R., Khuller, S., Kortsarz, G.: Approximating the minimal sensor selection for supervisory control. Discrete Event Dyn. Syst. 16, 143–170 (2006) MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC (outside the USA) 2011

Authors and Affiliations

  • Moses Charikar
    • 1
  • MohammadTaghi Hajiaghayi
    • 2
    • 3
  • Howard Karloff
    • 3
  1. 1.Department of Computer SciencePrinceton UniversityPrincetonUSA
  2. 2.University of Maryland at College ParkCollege ParkUSA
  3. 3.AT&T Labs—ResearchFlorham ParkUSA

Personalised recommendations