16 search results - page 4 / 4 » Improved Absolute Approximation Ratios for Two-Dimensional P... |
143
click to vote
SODA
2010
ACM
16 years 6 days 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...