Sciweavers

STOC
1994
ACM
95views Algorithms» more  STOC 1994»
14 years 4 months ago
Improved non-approximability results
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Mihir Bellare, Madhu Sudan
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
14 years 4 months ago
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
STOC
1994
ACM
123views Algorithms» more  STOC 1994»
14 years 4 months ago
Natural proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
Alexander A. Razborov, Steven Rudich
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
14 years 4 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 4 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
STOC
1994
ACM
88views Algorithms» more  STOC 1994»
14 years 4 months ago
Faster shortest-path algorithms for planar graphs
Philip N. Klein, Satish Rao, Monika Rauch Henzinge...
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
14 years 4 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
STOC
1994
ACM
93views Algorithms» more  STOC 1994»
14 years 4 months ago
Scalable expanders: exploiting hierarchical random wiring
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
Eric A. Brewer, Frederic T. Chong, Tom Leighton