Greedy algorithms for minimisation problems in random regular graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2161, Issue , 2001, Pages 524-536

  Zito, Michele ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE DOMINATING SET; GREEDY ALGORITHMS; INDEPENDENT DOMINATING SET; LOWER BOUNDS; MAXIMUM INDEPENDENT SETS; MINIMISATION; MINIMUM VERTEX COVER; RANDOM REGULAR GRAPH;

GRAPH THEORY;

EID: 84943240396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_44     Document Type: Conference Paper

References (29)

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.
2. P. Alimonti, V. Kann. Hardness of approximating problems on cubic graphs. In Proc. 3rd CIAC, pp 288-298. LNCS 1203, Springer-Verlag, 1997.
3. J. Aronson, A. Frieze, B. G. Pittel. Maximum matchings in sparse random graphs: Karp-Sipser revisited. RSA, 12:111-178, 1998.
4. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation. Springer-Verlag, 1999.
5. P. Berman, T. Fujito. Approximating independent sets in degree 3 graphs. In Proc. WADS'95, pp 449-460. LNCS 955, Springer-Verlag, 1995.
6. P. Berman, M. Karpinski. On some tighter inapproximability results. Technical Report TR98-29, ECCC, 1998.
7. B. Bollobás, P. Erdós. Cliques in random graphs. Math. Proc. Camb. Phil. Soc., 80:419-427, 1976.
8. R. L. Burden, J. D. Faires, A. C. Reynolds. Numerical Analysis. Wadsworth Int., 1981.
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. Pre-print available from the authors.
11. W. Duckworth, N. C. Wormald. Minimum independent dominating sets of random cubic graphs. Submitted to RSA, 2000.
12. A. Frieze, C. McDiarmid. Algorithmic theory of random graphs. RSA, 10:5-42, 1997.
13. A. M. Frieze. On the independence number of random graphs. Disc. Math., 81:171-175, 1990.
14. A. M. Frieze, T. Luczak. On the independence and chromatic number of random regular graphs. J. Comb. Theory, B 54:123-132, 1992.
15. M. R. Garey, D. S. Johnson. Computer and Intractability, a Guide to the Theory of NP-Completeness. Freeman & Company, 1979.
16. M. R. Garey, D. S. Johnson, L. Stockmeyer. Some simplified NP-complete graph problems. TCS, 1:237-267, 1976.
17. G. R. Grimmett, C. J. H. McDiarmid. On colouring random graphs. Math. Proc. Camb. Phil. Soc., 77:313-324, 1975.
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.
19. S. Janson, T. Luczak, A. Rucński. Random Graphs. John Wiley & Sons, 2000.
20. V. Kann. On the Approximability of NP-complete Optimization Problems. PhD thesis, Royal Institute of Technology, Stockholm, 1992.
21. B. Korte, D. Hausmann. An analysis of the greedy heuristic for independence systems. Annals of Disc. Math., 2:65-74, 1978.
22. B. D. McKay. Independent sets in regular graphs of high girth. Ars Combinatoria, 23A:179-185, 1987.
23. T. Nierhoff. The k-Center Problem and r-Independent Sets. PhD thesis, Humboldt-Universität zu Berlin, Berlin, 1999.
24. R. W. Robinson, N. C. Wormald. Almost all regular graphs are hamiltonian. RSA, 5:363-374, 1994.
25. N. C. Wormald. Differential equations for random processes and random graphs. Annals of Applied Prob., 5:1217-1235, 1995.
26. N. C. Wormald. The differential equation method for random graph processes and greedy algorithms. In M. Karoński, H. J. Prömel, editors, Lectures on Approximation and Randomized Algorithms, pages, 73-155. PWN, Warsaw, 1999.
27. M. Yannakakis, F. Gavril. Edge dominating sets in graphs. SIAM J. Applied Math., 38(3):364-372, June 1980.
28. M. Zito. Randomised Techniques in Combinatorial Algorithmics. PhD thesis, University of Warwick, 1999.
29. M. Zito. Small maximal matchings in random graphs. In Proc. LATIN 2000, pp 18-27. LNCS 1776, Springer-Verlag, 2000