Sciweavers

TALG
2010
109views more  TALG 2010»
14 years 11 months ago
Facility location with hierarchical facility costs
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...
Zoya Svitkina, Éva Tardos
70
Voted
TALG
2010
65views more  TALG 2010»
14 years 11 months ago
Maximal biconnected subgraphs of random planar graphs
Konstantinos Panagiotou, Angelika Steger
60
Voted
TALG
2010
59views more  TALG 2010»
14 years 11 months ago
Optimization problems in multiple-interval graphs
Ayelet Butman, Danny Hermelin, Moshe Lewenstein, D...
82
Voted
TALG
2010
74views more  TALG 2010»
14 years 11 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
75
Voted
TALG
2010
46views more  TALG 2010»
14 years 11 months ago
Approximate shared-memory counting despite a strong adversary
James Aspnes, Keren Censor