Heuristics for graph coloring (2006)
De Werra, D., Tinhofer, G., Mayoraz, E., Noltemeir, H., Syslo, M.
Improving Spanning Trees by Upgrading Nodes (1998)
S. O. Krumke, M. V. Marathe, H. Noltemeir, R. Ravi, S. Ravi
Id: upgrade.tex,v 2.2 1997#09#18 13:14:08 krumke Exp wirth We study bottleneck constrained network upgrading problems.We are given an edge weighted graph G =#V;E# where node v 2 V can be upgraded at...