598 search results - page 1 / 120 » Approximation Algorithms for the Bottleneck Stretch Factor P... |
96
Voted
STACS
2001
Springer
15 years 4 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
112
Voted
SIAMCOMP
2000
15 years 1 days ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
122
Voted
RANDOM
1998
Springer
15 years 4 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
113
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...