Search Sciweavers | Sciweavers

12

click to vote

FOCS
2009
IEEE

104views Theoretical Computer Science» more FOCS 2009»

Efficient Sketches for Earth-Mover Distance, with Applications

14 years 2 months ago

Download people.csail.mit.edu

Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P...

claim paper

Read More »

15

click to vote

FOCS
2009
IEEE

94views Theoretical Computer Science» more FOCS 2009»

Bounded Independence Fools Halfspaces

14 years 2 months ago

Download research.microsoft.com

Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jais...

claim paper

Read More »

16

click to vote

FOCS
2009
IEEE

90views Theoretical Computer Science» more FOCS 2009»

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

14 years 2 months ago

Download www-math.mit.edu

Aaron Archer, MohammadHossein Bateni, Mohammad Tag...

claim paper

Read More »

23

click to vote

FOCS
2009
IEEE

163views Theoretical Computer Science» more FOCS 2009»

Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions

14 years 2 months ago

Download www.openu.ac.il

Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph

Zeev Nutov

claim paper

Read More »

16

click to vote

FOCS
2009
IEEE

97views Theoretical Computer Science» more FOCS 2009»

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers

14 years 2 months ago

Download web.mit.edu

We extend the “method of multiplicities” to get the following results, of interest in combinatorics and randomness extraction.

Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madh...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers