11 search results - page 1 / 3 » Perfect Matchings in Balanced Hypergraphs - A Combinatorial ... |
32
Voted
COMBINATORICA
2002
14 years 9 months ago
2002
ICALP
2009
Springer
15 years 9 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...
EJC
2010
14 years 9 months ago
2010
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...