Sciweavers

59 search results - page 8 / 12
» esa 2005
Sort
View
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
14 years 3 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
14 years 3 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
ESA
2005
Springer
95views Algorithms» more  ESA 2005»
14 years 3 months ago
Finding Shortest Non-separating and Non-contractible Cycles for Topologically Embedded Graphs
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
Sergio Cabello, Bojan Mohar
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 3 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
ESA
2005
Springer
105views Algorithms» more  ESA 2005»
14 years 3 months ago
Matching Point Sets with Respect to the Earth Mover's Distance
Let A and B be two sets of m resp. n weighted points in the plane, with m ≤ n. We present (1 + ) and (2+ )-approximation algorithms for the minimum Euclidean Earth Mover’s Dis...
Sergio Cabello, Panos Giannopoulos, Christian Knau...