Graph coloring with rejection

DOI10.1016/j.jcss.2010.06.016zbMath1213.05077OpenAlexW2056070842MaRDI QIDQ632809

Leah Epstein, Asaf Levin, Gerhard J. Woeginger

Publication date: 28 March 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.06.016

zbMATH Keywords

graph coloringonline algorithmsapproximation algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (4)

On Variants of File Caching ⋮ Online hypergraph coloring with rejection ⋮ The online \(k\)-server problem with rejection ⋮ Online file caching with rejection penalties

Cites Work

• Unnamed Item
• Improved performance of the greedy algorithm for partial cover
• The maximum k-colorable subgraph problem for chordal graphs
• On chain and antichain families of a partially ordered set
• The greedy algorithm is optimal for on-line edge coloring
• On-line coloring \(k\)-colorable graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The NP-completeness column: an ongoing guide
• On-line and first fit colorings of graphs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Graph Classes: A Survey
• A General Approximation Technique for Constrained Forest Problems

This page was built for publication: Graph coloring with rejection