Sciweavers

18 search results - page 2 / 4
» stoc 1994
Sort
View
STOC
1994
ACM
88views Algorithms» more  STOC 1994»
13 years 9 months ago
Faster shortest-path algorithms for planar graphs
Philip N. Klein, Satish Rao, Monika Rauch Henzinge...
STOC
1994
ACM
91views Algorithms» more  STOC 1994»
13 years 9 months ago
The minimum latency problem
Avrim Blum, Prasad Chalasani, Don Coppersmith, Wil...
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
13 years 9 months ago
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
13 years 9 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
STOC
1994
ACM
93views Algorithms» more  STOC 1994»
13 years 9 months ago
Scalable expanders: exploiting hierarchical random wiring
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
Eric A. Brewer, Frederic T. Chong, Tom Leighton