SODA
1992
ACM
13 years 5 months ago
1992
ACM
SODA
1992
ACM
13 years 5 months ago
1992
ACM
In this paper we give the first self-testers and checkers for polynomials over rational and integer domains. We also show significantly stronger bounds on the efficiency of a simp...
SODA
1992
ACM
13 years 5 months ago
1992
ACM
SODA
1992
ACM
13 years 5 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
SODA
1992
ACM
13 years 5 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
SODA
1992
ACM
13 years 5 months ago
1992
ACM
SODA
1992
ACM
13 years 5 months 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...
SODA
1992
ACM
13 years 5 months 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...
SODA
1992
ACM
13 years 5 months 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
13 years 5 months ago
1992
ACM
We consider a version of the game "Twenty Questions" played on the set {0,