676 search results - page 45 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
116
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
118
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
115
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
179
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
133
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...