2698 search results - page 100 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
183
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
204
click to vote
IPCO
2008
15 years 7 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
178
click to vote
ESA
2003
Springer
15 years 11 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 ...
164
click to vote
CORR
2011
Springer
15 years 24 days ago
2011
Springer
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
178
click to vote
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...