Weighted node coloring: When stable sets are expensive

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

Volumn 2573 LNCS, Issue , 2002, Pages 114-125

  Demange, Marc ^a   De Werra, D ^b   Monnot, J ^c   Paschos, Vangelis Th ^c  

^a ESSEC BUSINESS SCHOOL   (France)

^b EPFL   (Switzerland)

^c UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COLORING; GRAPHIC METHODS;

APPROXIMABILITY; APPROXIMATION RESULTS; BIPARTITE GRAPHS; DECISION PROBLEMS; OPTIMAL SOLUTIONS; POSITIVE INTEGERS; WEIGHTED COLORING; WEIGHTED NODE COLORING; EXTENDED ABSTRACTS;

GRAPH THEORY;

EID: 84901415532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_11     Document Type: Conference Paper

References (16)

1. Demange, M., de Werra, D., Monnot, J., Paschos, V.T.: Time slot scheduling of compatible jobs. Cahier du LAMSADE 182, LAMSADE, Universit Paris-Dauphine (2001) Available on www address: http://www.lamsade.dauphine.fr/ cahdoc.html#cahiers.
2. Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: a review. European J. Oper. Res. 120 (2000) 228-249
3. Potts, C.N., Strusevich, V.A., Tautenhahn, T.: Scheduling batches with simultaneous job processing for two-machine shop problems. J. of Scheduling 4 (2001) 25-51
4. Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. JORBEL (2001) To appear.
5. Berge, C.: Graphs and hypergraphs. North Holland, Amsterdam (1973)
6. de Werra, D.: Heuristics for graph coloring. Computing 7 (1990) 191-208
7. Simon, H.U.: On approximate solutions for combinatorial optimization problems. SIAM J. Disc. Math. 3 (1990) 294-310
8. Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9 (1974) 256-278
9. Alfandari, L., Paschos, V.T.: Master-slave strategy and polynomial approximation. Comput. Opti. Appl. 16 (2000) 231-245
10. Boppana, B.B., Halldórsson, M.M.: Approximating maximum independent sets by excluding subgraphs. BIT 32 (1992) 180-196
11. Bodlaender, H.L., Jansen, K., Woeginger, G.J.: Scheduling with incompatible jobs. Discrete Appl. Math. 55 (1994) 219-232
12. de Werra, D., Erschler, J.: Open shop scheduling with some additional constraints. Graphs and Combinatorics 12 (1996) 81-93
13. Rendl, F.: On the complexity of decomposing matrices arising in satellite communication. Oper. Res. Lett. 4 (1985) 5-8
14. König, D.: ber graphen und iher anwendung auf determinantentheorie und mengenlehre. Math. Ann. 77 (1916) 453-465
15. Chvtal, V.: Perfectly ordered graphs. In Berge, C., Chvtal, V., eds.: Topics on Perfect Graphs. (Volume 21 of Annals of Discrete Math.) 253-277
16. Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Appl. Math. 75 (1997) 135-155