Sciweavers

SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 11 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas
SODA
1997
ACM
83views Algorithms» more  SODA 1997»
13 years 11 months ago
Experimental Study of Minimum Cut Algorithms
Chandra Chekuri, Andrew V. Goldberg, David R. Karg...
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
13 years 11 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
SODA
1997
ACM
98views Algorithms» more  SODA 1997»
13 years 11 months ago
The k-Client Problem
Houman Alborzi, Eric Torng, Patchrawat Uthaisombut...
SODA
1997
ACM
89views Algorithms» more  SODA 1997»
13 years 11 months ago
Optimal Point Placement for Mesh Smoothing
Nina Amenta, Marshall W. Bern, David Eppstein
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
13 years 11 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 11 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 11 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
13 years 11 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 11 months ago
Faster deterministic dictionaries
Rasmus Pagh