Multicoloring unit disk graphs on triangular lattice points

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 895-896

  Miyamoto, Yuichiro ^a   Matsui, Tomomi ^b  

^a SOPHIA UNIVERSITY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CO-COMPATIBILITY GRAPH; MULTICOLORING; UNDIRECTED GRAPHS;

ALGORITHMS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TWO DIMENSIONAL; VECTORS;

GRAPH THEORY;

EID: 20744437110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. T. Feder and S. M. Shende, Online channel allocation in FDMA network with reuse constraints, Information Processing Letters, 67 (1998), pp. 295-302.
2. D. S. Hochbaum, Various Notions of Approximations: Good, Better, Best and More. appears in Approximation Algorithms for NP-hard Problems, PWS Publishing Company, 1997.
3. M. V. Marathe, H. Breu, H. B. Hunt, S. S. Ravi, and D. J. Rosenkrantz, Simple heuristics for unit disk graph, Networks, 25 (1995), pp. 59-68.
4. C. McDiarmid and B. Reed, Channel assignment and weighted coloring, Networks, 36 (2000), pp. 114-117.
5. Y. Miyamoto and T. Matsui, Multicoloring unit disk graphs on triangular lattice points, Mathematical Engineering Technical Reports, University of Tokyo, METR 2004-29 (2004). (available from http://www.keisu.t.u-tokyo.ac.jp/Research/ techrep.0.html)
6. L. Narayanan and S. M. Shende, Static Frequency Assignment in Cellular Networks, Algorithmica, 29 (2001), pp. 396-409.
7. D. de Werra, Heuristics for graph-coloring, Computing, Suppl. 7 (1990), pp. 191-208.