10 search results - page 1 / 2 » Improved Bounds and Algorithms for Hypergraph Two-Coloring |
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
WG
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The computation of all minimal transversals of a given hypergraph in output-polynomial time is a long standing open question known as the transversal hypergraph generatio...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...