Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2001: Algorithms — ESA 2001 pp 524–536Cite as

Greedy Algorithms for Minimisation Problems in Random Regular Graphs

  • Conference paper
  • First Online:

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

Abstract

In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the minimum vertex cover (MVC), minimum independent dominating set (MIDS) and minimum edge dominating set (MEDS) problems. In almost all cases we are able to improve the best known results for these problems. Results for the MVC problem translate immediately to results for the maximum independent set problem. We also derive lower bounds on the size of an optimal MIDS.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
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. P. Alimonti, T. Calamoneri. Improved approximations of independent dominating set in bounded degree graphs. In Proc. 22nd WG, pp 2–16, LNCS 1197, Springer-Verlag, 1997.

    Google Scholar 

  2. P. Alimonti, V. Kann. Hardness of approximating problems on cubic graphs. In Proc. 3rd CIAC, pp 288–298. LNCS 1203, Springer-Verlag, 1997.

    Google Scholar 

  3. J. Aronson, A. Frieze, B. G. Pittel. Maximum matchings in sparse random graphs: Karp-Sipser revisited. RSA, 12:111–178, 1998.

    MATH  MathSciNet  Google Scholar 

  4. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation. Springer-Verlag, 1999.

    Google Scholar 

  5. P. Berman, T. Fujito. Approximating independent sets in degree 3 graphs. In Proc. WADS’95, pp 449–460. LNCS 955, Springer-Verlag, 1995.

    Google Scholar 

  6. P. Berman, M. Karpinski. On some tighter inapproximability results. Technical Report TR98-29, ECCC, 1998.

    Google Scholar 

  7. B. Bollobás, P. Erdos. Cliques in random graphs. Math. Proc. Camb. Phil. Soc. 80:419–427, 1976.

    MATH  Google Scholar 

  8. R. L. Burden, J. D. Faires, A. C. Reynolds. Numerical Analysis. Wadsworth Int., 1981.

    Google Scholar 

  9. P. Crescenzi, V. Kann. A compendium of NP optimization problems. Available at http://www.nada.kth.se/~viggo/wwwcompendium/, 2000.

  10. W. Duckworth, N. C. Wormald. Linear programming and the worst case analysis of greedy algorithms for cubic graphs. To be submitted. Preprint available from the authors.

    Google Scholar 

  11. W. Duckworth, N. C. Wormald. Minimum independent dominating sets of random cubic graphs. Submitted to RSA, 2000.

    Google Scholar 

  12. A. Frieze, C. McDiarmid. Algorithmic theory of random graphs. RSA, 10:5–42, 1997.

    MathSciNet  Google Scholar 

  13. A. M. Frieze. On the independence number of random graphs. Disc. Math., 81:171–175, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. M. Frieze, T. Łuczak. On the independence and chromatic number of random regular graphs. J. Comb. Theory, B 54:123–132, 1992.

    Google Scholar 

  15. M. R. Garey, D. S. Johnson. Computer and Intractability, a Guide to the Theory of NP-Completeness. Freeman & Company, 1979.

    Google Scholar 

  16. M. R. Garey, D. S. Johnson, L. Stockmeyer. Some simplified NP-complete graph problems. TCS, 1:237–267, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  17. G. R. Grimmett, C. J. H. McDiarmid. On colouring random graphs. Math. Proc. Camb. Phil. Soc., 77:313–324, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. S. Hochbaum. Easy solutions for the k-center problem or the dominating set problem on random graph. In Annals of Disc. Math., 25:189–210, 1985.

    MathSciNet  Google Scholar 

  19. S. Janson, T. Łuczak, A. Rucýnski. Random Graphs. John Wiley & Sons, 2000.

    Google Scholar 

  20. V. Kann. On the Approximability of NP-complete Optimization Problems. PhD thesis, Royal Institute of Technology, Stockholm, 1992.

    Google Scholar 

  21. B. Korte, D. Hausmann. An analysis of the greedy heuristic for independence systems. Annals of Disc. Math., 2:65–74, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  22. B. D. McKay. Independent sets in regular graphs of high girth. Ars Combinatoria, 23A:179–185, 1987.

    MathSciNet  Google Scholar 

  23. T. Nierhoff. The k-Center Problem and r-Independent Sets. PhD thesis, Humboldt-Universität zu Berlin, Berlin, 1999.

    Google Scholar 

  24. R. W. Robinson, N. C. Wormald. Almost all regular graphs are hamiltonian. RSA, 5:363–374, 1994.

    MATH  MathSciNet  Google Scholar 

  25. N. C. Wormald. Differential equations for random processes and random graphs. Annals of Applied Prob., 5:1217–1235, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  26. N. C. Wormald. The differential equation method for random graph processes and greedy algorithms. In M. Karoński, H. J. Pr:omel, editors, Lectures on Approximation and Randomized Algorithms, pages 73–155. PWN, Warsaw, 1999.

    Google Scholar 

  27. M. Yannakakis, F. Gavril. Edge dominating sets in graphs. SIAM J. Applied Math., 38(3):364–372, June 1980.

    Google Scholar 

  28. M. Zito. Randomised Techniques in Combinatorial Algorithmics. PhD thesis, University of Warwick, 1999.

    Google Scholar 

  29. M. Zito. Small maximal matchings in random graphs. In Proc. LATIN 2000, pp 18–27. LNCS 1776, Springer-Verlag, 2000.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Liverpool, Liverpool, L69 7ZF, UK

    Michele Zito

Authors
  1. Michele Zito
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, 33095, Paderborn, Germany

    Friedhelm Meyer auf der Heide

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zito, M. (2001). Greedy Algorithms for Minimisation Problems in Random Regular Graphs. In: auf der Heide, F.M. (eds) Algorithms — ESA 2001. ESA 2001. Lecture Notes in Computer Science, vol 2161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44676-1_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-44676-1_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44676-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation