11 search results - page 1 / 3 » Approximating coloring and maximum independent sets in 3-uni... |
SODA
2001
ACM
13 years 7 months ago
2001
ACM
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
AAIM
2007
Springer
14 years 13 days ago
2007
Springer
OL
2010
13 years 1 months ago
2010
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...