Approximation and Online Algorithms

DOI10.1007/11671411zbMath1125.68427OpenAlexW4210634114MaRDI QIDQ5898463

Reuven Bar Yehuda, Ido Feldman, Dror Rawitz

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11671411

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Related Items (4)

Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems ⋮ The complexity of minimum convex coloring ⋮ Convex recoloring of paths ⋮ Convex Recoloring of Paths

This page was built for publication: Approximation and Online Algorithms