Sciweavers

37 search results - page 3 / 8
» Independent Sets in Bounded-Degree Hypergraphs
Sort
View
132
Voted
ICALP
2009
Springer
16 years 28 days ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
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...
Elena Losievskaja, Geir Agnarsson, Magnús M...
103
Voted
LATIN
2004
Springer
15 years 6 months ago
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
93
Voted
FCT
2005
Springer
15 years 6 months ago
Path Coupling Using Stopping Times
Abstract. We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics ...
Magnus Bordewich, Martin E. Dyer, Marek Karpinski
103
Voted
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 2 months ago
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
Michael Krivelevich, Ram Nathaniel, Benny Sudakov