Colorings at minimum cost.

Robert Berke Dieter Mitsche

Published in: Discret. Math. (2010)

Keyphrases

minimum cost
np hard
graph coloring
approximation algorithms
network flow
network flow problem
spanning tree
capacity constraints
undirected graph
minimum cost flow
network simplex algorithm
search algorithm
lower bound
objective function
optimization problems
integer programming