An asymptotic approximation scheme for multigraph edge coloring

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 897-906

  Sanders, Peter ^a   Steurer, David ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COLOR; ERROR ANALYSIS; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; LOGARITHM; MULTIGRAPH EDGE COLORING; VIZING ALGORITHMS;

GRAPH THEORY;

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

References (13)

1. A. Caprara and R. Rizzi. Improving a family of approximation algorithms to edge color multigraphs. Information Processing Letters, 68:11-15, 1998.
2. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica, 21(1):5-12, 2000.
3. U. Feige, E. Ofek, and U. Wieder. Approximating maximum edge coloring in multigraphs. In APPROX, volume 2462 of LNCS, pages 108-121. Springer, 2002.
4. M. K. Goldberg. On multigraphs of almost maximal chromatic class (in russian). Diskret Analiz, 23:3-7, 1973.
5. D. S. Hochbaum, T. Nishizeki, and D. B. Shmoys. A better than "best possible" algorithm to edge color multigraphs. Journal of Algorithms, 7:79-104, 1986.
6. I. Holyer. The NP-completeness of edge-coloring. SIAM Journal on Computing, 10(4):718-720, 1981.
7. J. Kahn. Asymptotics of the chromatic index for multigraphs. Journal of Combinatorial Theory B, 68:233-254, 1996.
8. T. Nishizeki and K. Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM Journal on Discrete Mathematics, 3(3):391-410, August 1990.
9. M. W. Padberg and L. A. Wolsey. Fractional covers for forests and matchings. Math. Programming, 29(1):1-14, 1984.
10. M. Plantholt. A sublinear bound on the chromatic index of multigraphs. Discrete Mathematics, 202(1-3):201-213, 1999.
11. M. Plantholt. A combined logarithmic bound on the chromatic index of multigraphs. manuscript in preparation. The result was presented at the 34th Southeastern Int. Conf. on Combinatorics, Graph Theory, and Computing, Boca Raton, 2003.
12. P. D. Seymour. Some unsolved problems on one-factorization of graphs. In J. A. Bondy and U. S. R. Murty, editors, Graph Theory and Related Topics, pages 367-368. Academic Press, 1979.
13. V. G. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz, 3:23-30, 1964.