The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
Coloring interval graphs with First-Fit
Discrete Mathematics
A coloring problem for weighted graphs
Information Processing Letters
Randomized Lower Bounds for Online Path Coloring
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Buffer Allocation in Regular Dataflow Networks: An Approach Based on Coloring Circular-Arc Graphs
HIPC '96 Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)
Buffer minimization using max-coloring
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
An improved algorithm for online coloring of intervals with bandwidth
Theoretical Computer Science - Computing and combinatorics
Time slot scheduling of compatible jobs
Journal of Scheduling
Batch processing with interval graph compatibilities between tasks
Discrete Applied Mathematics
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Batch Coloring Flat Graphs and Thin
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
Discrete Applied Mathematics
Max-Coloring Paths: Tight Bounds and Extensions
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Weighted Coloring: further complexity and approximability results
Information Processing Letters
Approximating the max-edge-coloring problem
Theoretical Computer Science
On the max-weight edge coloring problem
Journal of Combinatorial Optimization
Improved approximation algorithms for the Max Edge-Coloring problem
Information Processing Letters
Clique clustering yields a PTAS for max-coloring interval graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Online interval coloring and variants
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Approximation algorithms for the max-coloring problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hi-index | 5.23 |
We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G=(V,E) and positive node weights w:V-(0,~), the goal is to find a proper node coloring of G whose color classes C"1,C"2,...,C"k minimize @?"i"="1^kmax"v"@?"C"""iw(v). We design a general framework which allows to convert approximation algorithms for standard node coloring into algorithms for max coloring. The approximation ratio increases by a multiplicative factor of at most e for deterministic offline algorithms and for randomized online algorithms, and by a multiplicative factor of at most 4 for deterministic online algorithms. We consider two specific hereditary classes which are interval graphs and perfect graphs. For interval graphs, we study the problem in several online environments. In the List Model, intervals arrive one by one, in some order. In the Time Model, intervals arrive one by one, sorted by their left endpoints. For the List Model we design a deterministic 12-competitive algorithm, and a randomized 3e-competitive algorithm. In addition, we prove a lower bound of 4 on the competitive ratio of any deterministic or randomized algorithm. For the Time Model, we use simplified versions of the algorithm and the lower bound of the List Model, to develop a deterministic 4-competitive algorithm, a randomized e-competitive algorithm, and to design a lower bounds of @f~1.618 on the deterministic competitive ratio and a lower bound of 43 on the randomized competitive ratio. The former lower bounds hold even for unit intervals. For unit intervals in the List Model, we obtain a deterministic 8-competitive algorithm, a randomized 2e-competitive algorithm and lower bounds of 2 on the deterministic competitive ratio and 116~1.8333 on the randomized competitive ratio. Finally, we employ our framework to obtain an offline e-approximation algorithm for max coloring of perfect graphs, improving and simplifying a recent result of Pemmaraju and Raman.