Graph colouring problems and their applications in scheduling

Periodica Polytechnica Electrical Engineering

Volumn 48, Issue 1-2, 2004, Pages 11-16

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Colouring; List colouring; Minimum sum colouring; Multicolouring; Precolouring extension; Scheduling

Indexed keywords

APPROXIMATION THEORY; COLORING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

FREQUENCY ASSIGNMENT; LIST COLORING; MINIMUM SUM COLORING; MULTICOLORING; PRECOLORING EXTENSION;

GRAPH THEORY;

EID: 10444286992     PISSN: 03246000     EISSN: 15873781     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (22)

1. COFFMAN, E. G. - GAREY, JR. M. R. - JOHNSON, D. S. - LAPAUGH, A. S., Scheduling File Transfers, SIAM J. Comput., 14 (3) (1985), pp. 744-780.
2. HOOGEVEEN, J. A. - VAN DE VELDE, S. L. - VELTMAN, B., Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations, Discrete Appl. Math., 55 (3) (1994), 259-272.
3. HOLYER, I., The NP-Completeness of Edge-Coloring, SIAM J. Comput., 10 (4) (1981), pp. 718-720.
4. NISHIZEKI, T. - KASHIWAGI, K., On the 1.1 Edge-Coloring of Multigraphs, SIAM J. Discrete Math., 3 (3) (1990), pp. 391-410.
5. GRAF, A. - STUMPF, M. - WEIßENFELS, G., On Coloring Unit Disk Graphs, Algorithmica, 20 (3) (1998), pp. 277-293.
6. NARAYANAN, L. - SHENDE, S. M., Static Frequency Assignment in Cellular Networks, Algorithmica, 29 (3) (2001) pp. 396-409.
7. BIRÓ, M. - HUJTER, M. - TUZA, ZS., Precoloring Extension. I. Interval Graphs, Discrete Math., 100 (1-3) (1992), pp. 267-279.
8. HUJTER, M. - TUZA, ZS., Precoloring Extension. II. Graph Classes Related to Bipartite Graphs, Acta Mathematica Universitatis Comenianae, 62 (1) (1993), pp. 1-11.
9. HUJTER, M. - TUZA, ZS., Precoloring Extension. III. Classes of Perfect Graphs, Combin. Probab. Comput., 5 (1) (1996), pp. 35-56.
10. MARX, D., Precoloring Extension on Chordal Graphs, 2003, submitted.
11. JANSEN, K. - SCHEFFLER, P., Generalized Coloring for Tree-Like Graphs, Discrete Appl. Math., 75 (2) (1997), pp. 135-155.
12. GIARO, K. - KUBALE, M., Edge-Chromatic Sum of Trees and Bounded Cyclicity Graphs, Inform. Process. Lett., 75 (1-2) (200), pp. 65-69.
13. MARX, D., The Complexity of Tree Multicolorings, in Mathematical Foundations of Computer Science 2002 (Warsaw-Otwock), pp. 532-542. Springer, Berlin, 2002.
14. MARCOTTE, O. - SEYMOUR, P. D., Extending an Edge-Coloring, J. Graph Theory, 14 (5) (1990), pp. 565-573.
15. MARX, D., List Edge Multicoloring in Graphs with Few Cycles, Inform. Process. Lett., 89 (2) (2004), pp. 85-90.
16. KUBICKA, E. - SCHWENK, A. J., An Introduction to Chromatic Sums, in Proceedings of the ACM Computer Science Conf., pp. 15-21. Springer, Berlin, 1989.
17. BAR-NOY, A. - BELLARE, M. - HALLDÓRSSON, M. M. - SHACHNAI, H. - TAMIR, T., On Chromatic Sums and Distributed Resource Allocation, Inform. and Comput., 140 (2) (1998), pp. 183-202.
18. GIARO, K. - JANCZEWSKI, R. - KUBALE, M - MAI AFIEJSKI, M., A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs, in Proceedings of APPROX 2002, (2002), pp. 135-145.
19. BAR-NOY, A. - HALLDÓRSSON, M. M. - KORTSARZ, G. - SALMAN, R. - SHACHNAI, H., Sum Multicoloring of Graphs, J. Algorithms, 37 (2) (2000), pp. 422-450.
20. HALLDÓRSSON, M. M. - KORTSARZ, G. - PROSKUROWSKI, A. - SALMAN, R. -SHACHNAI, H. - TELLE, J. A., Multicoloring Trees, Inform, and Comput., 180(2):113-129, 2003.
21. HALLDÓRSSON, M. M. - KORTSARZ, G., Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees, J. Algorithms, 42 (2) (2002), pp. 334-366.
22. MARX, D., Minimum Sum Multicoloring on the Edges of Trees, 1st Workshop on Approximation and Online Algorithms (WAOA), Budapest, (2003) pp. 214-226, Lecture Notes in Comput Sci., 2909, Springer, Berlin, 2004.