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:
ICCI (1993)
Keyphrases
</>
approximation algorithms
np hard
special case
minimum cost
undirected graph
circular arcs
worst case
vertex cover
primal dual
randomized algorithms
image sequences
combinatorial auctions
precedence constraints
polynomial time approximation
optimal solution
approximation ratio