SODA
1997
ACM
14 years 1 months ago
1997
ACM
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...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
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...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
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).
SODA
1997
ACM
14 years 1 months ago
1997
ACM
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...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
SODA
1997
ACM
14 years 1 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
SODA
1997
ACM
14 years 1 months ago
1997
ACM
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...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
SODA
1997
ACM
14 years 1 months ago
1997
ACM