1389 search results - page 35 / 278 » Improved Approximation Algorithms for Label Cover Problems |
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
112
click to vote
IPL
2010
14 years 6 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
103
click to vote
STOC
2004
ACM
15 years 12 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
103
Voted
ESA
2003
Springer
15 years 4 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
ACL
2010
14 years 9 months ago
2010
Prior use of machine learning in genre classification used a list of labels as classification categories. However, genre classes are often organised into hierarchies, e.g., coveri...