STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM
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 ...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM
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...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
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...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM
STOC
2010
ACM
14 years 5 months ago
2010
ACM
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...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
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...
STOC
2010
ACM
14 years 9 months ago
2010
ACM