1389 search results - page 52 / 278 » Improved Approximation Algorithms for Label Cover Problems |
185
Voted
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
97
Voted
COMGEO
2010
ACM
15 years 2 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
129
Voted
DISOPT
2006
15 years 2 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
112
Voted
COCOA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In wireless communication networks, optimal use of the directional antenna is very important. The directional antenna coverage (DAC) problem is to cover all clients with ...
118
Voted
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...