1201 search results - page 109 / 241 » Linear Probing and Graphs |
154
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
136
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
135
click to vote
SIROCCO
1998
15 years 5 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
133
click to vote
CVGIP
2004
15 years 4 months ago
2004
In this article a novel algorithm is presented for 2D shape interpolation using the intrinsic shape parameters of a piecewise linear curve. The skeletons of two given shapes are c...
173
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...