Sciweavers

SODA
1997
ACM
76views Algorithms» more  SODA 1997»
13 years 5 months ago
Markov Chains for Linear Extensions, the Two-Dimensional Case
We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of lin...
Stefan Felsner, Lorenz Wernisch
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 5 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 5 months ago
Faster Construction of Planar Two-Centers
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
David Eppstein
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
13 years 5 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
SODA
1997
ACM
108views Algorithms» more  SODA 1997»
13 years 5 months ago
Coloring with Defect
Lenore Cowen, Wayne Goddard, C. E. Jesurum
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 5 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 5 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 5 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 5 months ago
The k-Client Problem
Houman Alborzi, Eric Torng, Patchrawat Uthaisombut...
SODA
1997
ACM
89views Algorithms» more  SODA 1997»
13 years 5 months ago
Optimal Point Placement for Mesh Smoothing
Nina Amenta, Marshall W. Bern, David Eppstein