Skip to main content
SpringerLink
Log in
Book cover

Operations Research Proceedings 1999 pp 69–74Cite as

Approximating Stable Sets Using the ϑ-function and Cutting Planes

  • Conference paper

  • 371 Accesses

Part of the book series: Operations Research Proceedings 1999 ((ORP,volume 1999))

Abstract

We investigate an approximation algorithm for the maximum stable set problem based on the Lovász number ϑ(G) as an initial upper bound. We strengthen this relaxation by adding two classes of cutting planes, odd circuit and triangle inequalities. We present computational results using this tighter model on several classes of graphs.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   132.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. M. Bomze, M. Pelillo, and R. Giacomini. Evolutionary approach to the maximum clique problem: Empirical evidence on a larger scale. In I. M. Bomze, T. Csendes, R. Horst, and P. M. Pardalos, editors, Developments in Global Optimization, pages 95–108. Kluwer Academic Publishers, Dordrecht, 1997.

    Chapter  Google Scholar 

  2. M. Grötschel, L. Lovasz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169–197, 1981.

    Article  Google Scholar 

  3. M. Grötschel, L. Lovasz, and A. Schrijver. Relaxations of vertex packing. Journal of Combinatorial Theory, 40:330–343, 1986.

    Article  Google Scholar 

  4. Martin Grötschel, László Lovász, and Alexander Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York, 1988.

    Google Scholar 

  5. G. Gruber. Semidefinite Programming and Combinatorial Optimization. PhD thesis, University of Technology, Graz, Austria, 1999. (forthcoming).

    Google Scholar 

  6. Jonas Hasselberg, Panos M. Pardalos, and George Vairaktarakis. Test case generators and computational results for the maximum clique problem. Global Optimization, 3:463–482, 1993.

    Article  Google Scholar 

  7. C. Helmberg, S. Poljak, F. Rendl, and H. Wolkowicz. Combining semidefinite and polyhedral relaxations for integer programs. In Proceedings of the 4th International IPCO Conference, volume 920 of Lecture Notes in Computer Science, pages 124–134. Springer, 1995.

    Google Scholar 

  8. C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz. An interior point method for semidefinite programming. SIAM Journal on Optimization, 6(2):342–361, May 1996.

    Article  Google Scholar 

  9. Donald E. Knuth. The sandwich theorem. The Electronic Journal of Combinatorics, 1(A1), 1994.

    Google Scholar 

  10. L. Lovász. On the shannon capacity of a graph. IEEE Trans. Inform. Theory, 25:1–7, 1979.

    Article  Google Scholar 

  11. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0–1 optimization. SIAM Journal of Optimization, 1(2):166–190, May 1991.

    Article  Google Scholar 

  12. L. A. Sanchis. Test case construction for the vertex cover problem. In Computational Support for Discrete Mathematics, volume 15 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1052–1798. American Mathematical Society, March 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Universität Klagenfurt, Austria

    Gerald Gruber & Franz Rendl

Authors
  1. Gerald Gruber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franz Rendl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Wirtschaftswissenschaft, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Karl Inderfurth  & Gerhard Schwödiauer  & 

  2. Fachbereich Rechts- und Wirtschaftswissenschaften, Technische Universität Darmstadt, Hochschulstr. 1, D-64289, Darmstadt, Germany

    Wolfgang Domschke

  3. Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, D-39106, Magdeburg, Germany

    Friedrich Juhnke

  4. Wirtschaftswissenschaftliche Fakultät, Universität Passau, Innstr. 29, D-90030, Passau, Germany

    Peter Kleinschmidt

  5. Wirtschaftswissenschaftliche Fakultät, Martin-Luther-Universität Halle-Wittenberg, Große Steinstr. 73, D-06108, Halle/Saale, Germany

    Gerhard Wäscher

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gruber, G., Rendl, F. (2000). Approximating Stable Sets Using the ϑ-function and Cutting Planes. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58300-1_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67094-0

  • Online ISBN: 978-3-642-58300-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation