Weighted coloring: Further complexity and approximability results

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

Volumn 3701 LNCS, Issue , 2005, Pages 205-214

  Escoffier, Bruno ^a   Monnot, Jérôme ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation algorithm; Interval graphs; Line graph of bipartite graphs; NP complete problems; Partial k tree; Weighted coloring

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHM; INTERVAL GRAPHS; LINE GRAPH OF BIPARTITE GRAPHS; WEIGHTED COLORING;

GRAPH THEORY;

EID: 33646185828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_17     Document Type: Conference Paper

References (15)

1. G. Berge. Graphs and Hypergraphs. North Holland, Amsterdam, 1973.
2. M. Boudhar and G. Finke. Scheduling on a batch machine with job compatibilities. Special issue ORBEL-14: Emerging challenges in operations research (Mons, 2000). Belg. J. Oper. Res. Statist. Comput. Sci., 40(1-2):69-80, 2000.
3. D. de Werra, M. Demange, B. Escoffer, J. Monnot and V.Th. Paschos. Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation. Proc. ISAAC'04, LNCS 3341, 896-907, 2004.
4. D. de Werra, M. Demange, J. Monnot and V.Th. Paschos. Weighted node coloring: when stable sets are expensive. Proc. WG'02, LNCS 2573:114-125, 2002.
5. G. Finke, V. Jost, M. Queyranne, A. Seb and X. Zhu. Batch Processing With Interval Graph Compatibilities Between Tasks. Cahiers du laboratoire Leibniz, 108, 2004, (available at http://www.leibniz.imag.fr/NEWLEIBNIZ/LesCahiers/index. xhtml.)
6. M.R. Garey, D.S. Johnson, G.L. Miller and C.H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM J. Algebraic Dicrete Methods, 1:216-222, 1980.
7. M. R. Garey and D. S. Johnson. Computers and intractability, a guide to the theory of NP-completeness. CA, Freeman, 1979.
8. D. J. Guan and X. Zhu. A Coloring Problem for Weighted Graphs. Inf. Process. Lett., 61(2):77-81 1997.
9. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
10. H. Grotzsch, Ein dreifarbensatz fur dreikreisfreie netze auf der kugel, Wiss. Z. Martin Luther Univ. Halle-Wittenberg, Math. Naturwiss Reihe 8 (1959), 109-120.
11. K. Jansen and P. Scheffler: Generalized coloring for tree-like graphs. Discrete Applied Mathematics, 75:135-155, 1997.
12. D. König, ber graphen und iher anwendung auf determinantentheorie und mengenlehre. Math. Ann., 77:453-465, 1916.
13. J. Kratochvl and Z. Tuza. Algorithmic complexity of list colorings. Discrete Applied Mathematics, 50(3): 297-302, 1994.
14. S. V. Pemmaraju, R. Raman and K. R. Varadarajan. Buffer minimization using max-coloring. SODA 562-571, 2004.
15. S. V. Pemmaraju and R. Raman. Approximation algorithms for the max-coloring. ICALP, (to appear) 2005.