Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs

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

Volumn 1763, Issue , 2000, Pages 194-200

  Matsui, Tomomi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COLORING; COMPUTATIONAL GEOMETRY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; SET THEORY;

COLORING PROBLEMS; INDEPENDENT SET PROBLEMS; INTERSECTION GRAPH; MAXIMUM INDEPENDENT SETS; STRONGLY POLYNOMIAL TIME; STRONGLY POLYNOMIAL TIME ALGORITHM; TIME COMPLEXITY; UNIT DISK GRAPHS;

GRAPH THEORY;

EID: 84947801035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46515-7_16     Document Type: Conference Paper

References (8)

1. S. Arora and C. Lund and R. Motwani and M. Sudan and M. Szegedy: Proof verification and intractability of approximation problems. Proc. 33rd IEEE Symposium on Foundations of Computer Science, 13-22 (1992).
2. B. N. Clark and C. J. Colbourn and D. S. Johnson: Unit disk graphs. Discrete Mathematics, 86 (1990) 165-177.
3. D. S. HOCHBAUM: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Applied Mathematics, 6 (1983) 243-254.
4. M. Grotschel and L. Lovasz and A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1 (1981) 169-197.
5. E. L. Lawler: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976).
6. M. V. Marathe and H. Breu and H.B. Hunt III and S.S. Ravi and D.S. Rosenkrantz: Simple heuristics for unit disk graphs. Networks, 25 (1995) 59-68.
7. E. Tardos: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research, 34 (1986) 250-256.
8. S. Tsukiyama and M. IDE and H. Ariyoshi and I. Shirakawa: A new algorithm for generating all the maximal independent sets. SIAM J. On Computing, 6 (1977) 505-517.