Sciweavers

STOC
2010
ACM
618views Algorithms» more  STOC 2010»
14 years 2 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 ...
STOC
2010
ACM
378views Algorithms» more  STOC 2010»
14 years 2 months ago
On the Geometry of Differential Privacy
Moritz Hardt and Kunal Talwar
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
13 years 10 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
274views Algorithms» more  STOC 2010»
14 years 2 months ago
Odd Cycle Packing
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
Ken-ichi Kawarabayashi and Bruce Reed
Algorithms
Top of PageReset Settings