2354 search results - page 345 / 471 » Assignment Problems |
139
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
132
Voted
SAT
2005
Springer
15 years 8 months ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
153
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
122
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
118
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract—This paper studies the problem of utility maximization for clients with delay based QoS requirements in wireless networks. We adopt a model used in a previous work that ...