489 search results - page 4 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
NETWORKS
2006
13 years 7 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
STOC
1998
ACM
13 years 11 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...