Sciweavers

16 search results - page 4 / 4
» Improved Absolute Approximation Ratios for Two-Dimensional P...
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
13 years 12 months ago
On linear and semidefinite programming relaxations for hypergraph matching
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...
Yuk Hei Chan, Lap Chi Lau