Sciweavers

Share
SODA
1992
ACM
95views Algorithms» more  SODA 1992»
9 years 2 months ago
The Probabilistic Method
Joel Spencer
SODA
1992
ACM
90views Algorithms» more  SODA 1992»
9 years 2 months ago
Self-Testing Polynomial Functions Efficiently and Over Rational Domains
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...
Ronitt Rubinfeld, Madhu Sudan
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
9 years 2 months ago
Separation and Approximation of Polyhedral Objects
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...
Joseph S. B. Mitchell, Subhash Suri
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
9 years 2 months ago
Computing Minimal Spanning Subgraphs in Linear Time
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 ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
9 years 2 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy
SODA
1992
ACM
252views Algorithms» more  SODA 1992»
9 years 2 months ago
A General Approximation Technique for Constrained Forest Problems
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...
Michel X. Goemans, David P. Williamson
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
9 years 2 months ago
New Algorithms for Minimum Area k-gons
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...
David Eppstein
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
9 years 2 months ago
Approximating the Minimum Weight Triangulation
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...
David Eppstein
SODA
1992
ACM
116views Algorithms» more  SODA 1992»
9 years 2 months ago
On Playing "Twenty Questions" with a Liar
We consider a version of the game "Twenty Questions" played on the set {0,
Aditi Dhagat, Péter Gács, Peter Wink...
books