On the Max Coloring Problem

DOI10.1007/978-3-540-77918-6_12zbMath1130.90408OpenAlexW2175374991MaRDI QIDQ5443379

Leah Epstein, Asaf Levin

Publication date: 20 February 2008

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_12

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coloring problem for weighted graphs
• Time slot scheduling of compatible jobs
• Weighted coloring: further complexity and approximability results
• An on-line graph coloring algorithm with sublinear performance ratio
• Geometric algorithms and combinatorial optimization.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Coloring interval graphs with First-Fit
• On-line and first fit colorings of graphs
• The Linearity of First-Fit Coloring of Interval Graphs
• On some packing problem related to dynamic storage allocation
• Computing and Combinatorics
• Algorithms and Computation
• Automata, Languages and Programming
• Automata, Languages and Programming
• Approximation and Online Algorithms

Related Items (7)

Batch Coloring Flat Graphs and Thin ⋮ Bounded max-colorings of graphs ⋮ Clique Clustering Yields a PTAS for max-Coloring Interval Graphs ⋮ Online unit clustering: Variations on a theme ⋮ Approximating the max-edge-coloring problem ⋮ Weighted coloring on planar, bipartite and split graphs: Complexity and approximation ⋮ Clique partitioning with value-monotone submodular cost

This page was built for publication: On the Max Coloring Problem