37 search results - page 1 / 8 » Independent Sets in Bounded-Degree Hypergraphs |
WADS
2007
Springer
13 years 12 months ago
2007
Springer
STACS
2010
Springer
14 years 24 days ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
TAPAS
2011
13 years 23 days ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
SWAT
1994
Springer
13 years 10 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
COCO
2009
Springer
14 years 11 days ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...