111
Voted
SODA
1992
ACM
15 years 2 days ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
96
Voted
SODA
1992
ACM
15 years 2 days ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
100
click to vote
SODA
1992
ACM
15 years 2 days ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
SODA
1992
ACM
15 years 2 days ago
1992
ACM
We consider a version of the game "Twenty Questions" played on the set {0,
67
Voted
SODA
1992
ACM
15 years 2 days ago
1992
ACM
76
Voted
SODA
1992
ACM
15 years 2 days ago
1992
ACM
101
Voted
SODA
1992
ACM
15 years 2 days ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
91
Voted
SODA
1992
ACM
15 years 2 days ago
1992
ACM
An m
84
Voted
SODA
1990
ACM
15 years 2 days ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
99
Voted
SODA
1990
ACM
15 years 2 days ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...