Sciweavers

ICALP
2009
Springer
15 years 4 days ago
On Finding Dense Subgraphs
Samir Khuller, Barna Saha
ICALP
2009
Springer
15 years 4 days ago
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
Sudipto Guha, Zhiyi Huang
ICALP
2009
Springer
15 years 4 days ago
Testing Fourier Dimensionality and Sparsity
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
Parikshit Gopalan, Ryan O'Donnell, Rocco A. Served...
ICALP
2009
Springer
15 years 4 days ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
ICALP
2009
Springer
15 years 4 days ago
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
ICALP
2009
Springer
15 years 4 days ago
Functional Monitoring without Monotonicity
The notion of distributed functional monitoring was recently introduced by Cormode, Muthukrishnan and Yi [CMY08] to initiate a formal study of the communication cost of certain fu...
Chrisil Arackaparambil, Joshua Brody, Amit Chakrab...
ICALP
2009
Springer
15 years 4 days ago
Wireless Communication Is in APX
Abstract. In this paper we address a common question in wireless communication: How long does it take to satisfy an arbitrary set of wireless communication requests? This problem i...
Magnús M. Halldórsson, Roger Wattenh...
ICALP
2009
Springer
15 years 4 days ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...