Sciweavers

STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 2 months ago
On the Complexity of #CSP
Martin Dyer and David Richerby
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
14 years 2 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
STOC
2010
ACM
154views Algorithms» more  STOC 2010»
14 years 2 months ago
Bayesian Algorithmic Mechanism Design
Jason D. Hartline and Brendan Lucier
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
14 years 2 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMS...
Vladimir Braverman and Rafail Ostrovsky
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 2 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
STOC
2010
ACM
171views Algorithms» more  STOC 2010»
14 years 2 months ago
An Optimal Ancestry Scheme and Small Universal Posets
Pierre Fraigniaud and Amos Korman
STOC
2010
ACM
186views Algorithms» more  STOC 2010»
14 years 2 months ago
Matroid Matching: the Power of Local Search
Jon Lee, Maxim Sviridenko and Jan Vondrak
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 2 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
STOC
2010
ACM
618views Algorithms» more  STOC 2010»
14 years 6 months ago
Differential Privacy Under Continual Observation
We ask the question ? how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user's privacy? We propose a differ...
Cynthia Dwork, Moni Naor, Toniann Pitassi and Guy ...