Greedily approximating the r-independent set and k-center problems on random instances

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

Volumn 1269, Issue , 1997, Pages 43-53

  Kreuter, Bernd ^a   Nierhoff, Till ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; RANDOM PROCESSES;

DOMINATING SET PROBLEMS; GREEDY ALGORITHMS; INDEPENDENT SET; K-CENTER PROBLEM; PERFORMANCE RATIO; RANDOM GRAPHS; RANDOM INSTANCE;

APPROXIMATION ALGORITHMS;

EID: 84957693576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63248-4_4     Document Type: Conference Paper

References (11)

1. N. Alon, J, H. Spencer, and P. Erdös. The Probabilistic Method. Wiley, 1992.
2. B. Bollobás, Random Graphs. Academic Press, 1985.
3. Y. D. Burtin. On extreme metric parameters of a random graph: I. asymptotic estimates. Theory of Probability and its Applications, 19(4):710-725, 1974.
4. Y. D. Burtin. On extreme metric characteristics of a random graph: II. limit distributions. Theory of Probability and its Applications, 20(1):83-101, 1975.
5. G. J. Chang and G. L. Nemhauser. The k-domination and fc-stability problems on sun-free chordal graphs. SIAM Journal on Algebraic Discrete Methods, 5(3):332- 345, 1984.
6. A. Frieze and C. McDiarmid. Algorithmic theory of random graphs. Random Structures & Algorithms, 10:5-42, 1997.
7. A. M. Frieze. On the independence number of random graphs. Discrete Mathematics, 81:171-175, 1990.
8. G. R. Grimmett and C. McDiarmid. On colouring random graphs. Proceedings of the Cambridge Philosophical Society, 77:313-324, 1975.
9. S. T. Hedetniemi and R. C. Laskar. Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Mathematics, 86:257-277, 1990.
10. D. S. Hochbaum. Easy solutions for the fc-center problem or the dominating set problem on random graphs. Annals of Discrete Mathematics, 25:189-210, 1985.
11. C. McDiarmid. Colouring random graphs. Annals of Operations Research, 1:183- 200, 1984.