598 search results - page 19 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
COCOON
2005
Springer
14 years 27 days ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
ALGORITHMICA
2011
13 years 2 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...