Sciweavers

SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 29 days ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
SODA
1998
ACM
83views Algorithms» more  SODA 1998»
14 years 29 days ago
Collision Detection in Aspect and Scale Bounded Polyhedra
Subhash Suri, Philip M. Hubbard, John F. Hughes
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
14 years 29 days ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
SODA
1998
ACM
86views Algorithms» more  SODA 1998»
14 years 29 days ago
Analysis of a Local Search Heuristic for Facility Location Problems
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Ra...
SODA
1998
ACM
104views Algorithms» more  SODA 1998»
14 years 29 days ago
On-line Randomized Call Control Revisited
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
Stefano Leonardi, Alberto Marchetti-Spaccamela, Al...
SODA
1998
ACM
71views Algorithms» more  SODA 1998»
14 years 29 days ago
On the Distributed Complexity of Computing Maximal Matchings
Michal Hanckowiak, Michal Karonski, Alessandro Pan...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
14 years 29 days ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller