Sciweavers

SODA
1998
ACM
106views Algorithms» more  SODA 1998»
14 years 26 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
SODA
1998
ACM
88views Algorithms» more  SODA 1998»
14 years 26 days ago
Fast Distributed Algorithms for {Brooks-Vizing} Colourings
d Abstract) David A. Grable Alessandro Panconesi BRICS Report Series RS-97-37 ISSN 0909-0878 December 1997
David A. Grable, Alessandro Panconesi
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
14 years 26 days ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
SODA
1998
ACM
114views Algorithms» more  SODA 1998»
14 years 26 days ago
Exact Arithmetic at Low Cost - A Case Study in Linear Programming
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
Bernd Gärtner
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
14 years 26 days ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
14 years 26 days ago
Approximate String Matching: A Simpler Faster Algorithm
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Richard Cole, Ramesh Hariharan
SODA
1998
ACM
81views Algorithms» more  SODA 1998»
14 years 26 days ago
The Dynamic Servers Problem
Moses Charikar, Dan Halperin, Rajeev Motwani
SODA
1998
ACM
89views Algorithms» more  SODA 1998»
14 years 26 days ago
Approximation Algorithms for Directed Steiner Problems
Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zu...
SODA
1998
ACM
98views Algorithms» more  SODA 1998»
14 years 26 days ago
Finger Search Trees with Constant Insertion Time
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
Gerth Stølting Brodal