Skip to main content
SpringerLink
Log in

Hard graphs for randomized subgraph exclusion algorithms

  • Conference paper
  • First Online:
Book cover Algorithm Theory — SWAT '94 (SWAT 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 824))

Included in the following conference series:

  • 145 Accesses

Abstract

A randomized version of the Clique approximation algorithm by Boppana and Halldórsson is analyzed. The Boppana Halldórsson algorithm is currently the only approximation algorithm for the Clique problem with a non-trivial performance guarantee. This paper presents a class of graphs on which the performance ratio of the randomized version of the algorithm is not better than Ω(√n) with probability greater than 1-1/n ω(1).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Noga Alon, Joel Spencer, and Paul Erdös. The Probabilistic Method. Wiley, 1992.

    Google Scholar 

  2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In 33rd FOCS, pages 14–23, 1992.

    Google Scholar 

  3. R. Boppana and M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. In SWAT, pages 11–25. Springer Verlag, 1990.

    Google Scholar 

  4. R. Boppana and M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32:180–196, 1992.

    Google Scholar 

  5. P. Frankl and R. M. Wilson. Intersection theorems with geometric consequences. Combinatorica, 1(4):357–368, 1981.

    Google Scholar 

  6. Torben Hagerup and Christine Rub. A guided tour of Chernoff bounds. Information Processing Letters, 33:305–308, 1989.

    Google Scholar 

  7. Mark Jerrum. Large cliques elude the metropolis process. Random Structures and Algorithms, 3(4):347–360, 1992.

    Google Scholar 

  8. Ludek Kučera. The greedy coloring is a bad probabilistic algorithm. Journal of Algorithms, 12:674–684, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Boston University, 02215, Boston, MA, USA

    Marcus Peinado

Authors
  1. Marcus Peinado
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Erik M. Schmidt Sven Skyum

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peinado, M. (1994). Hard graphs for randomized subgraph exclusion algorithms. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-58218-5_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58218-2

  • Online ISBN: 978-3-540-48577-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation