598 search results - page 2 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
116
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
204
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
124
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
101
Voted
SWAT
2004
Springer
15 years 8 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
135
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...