3874 search results - page 76 / 775 » Approximation Algorithms for k-hurdle Problems |
131
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
151
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
171
Voted
OL
2011
14 years 10 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
112
Voted
IJCGA
2002
15 years 3 months ago
2002
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n uniform, non-intersecting, maximum-size open circles such that each point touc...
133
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...