WAOA
2004
Springer
13 years 10 months ago
2004
Springer
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...