1193 search results - page 1 / 239 » On the Complexity of Approximating Colored-Graph Problems |
COCOON
1999
Springer
13 years 9 months ago
1999
Springer
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
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...
CAD
2002
Springer
13 years 4 months ago
2002
Springer
This paper presents a method for three-dimensional surface flattening, which can be efficiently used in threedimensional computer aided garment design. First, facet model is used ...