Login / Signup
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.
Madhav V. Marathe
Harry B. Hunt III
S. S. Ravi
Published in:
Discret. Appl. Math. (1996)
Keyphrases
</>
approximation algorithms
np hard
undirected graph
worst case
circular arcs
special case
vertex cover
minimum cost
primal dual
open shop
weighted graph
supervised learning
straight line
graph structure
randomized algorithms