37 search results - page 8 / 8 » Hardness of Approximate Hypergraph Coloring |
JCO
2010
13 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
STACS
2007
Springer
14 years 11 days ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...