DeepAI AI Chat
Log In Sign Up

Approximation Schemes for Covering and Packing in the Streaming Model

by   Christopher Liaw, et al.
The University of British Columbia

The shifting strategy, introduced by Hochbaum and Maass, and independently by Baker, is a unified framework for devising polynomial approximation schemes to NP-Hard problems. This strategy has been used to great success within the computational geometry community in a plethora of different applications; most notably covering, packing, and clustering problems. In this paper, we revisit the shifting strategy in the context of the streaming model and develop a streaming-friendly shifting strategy. When combined with the shifting coreset method introduced by Fonseca et al., we obtain streaming algorithms for various graph properties of unit disc graphs. As a further application, we present novel approximation algorithms and lower bounds for the unit disc cover (UDC) problem in the streaming model, for which currently no algorithms are known.


page 1

page 2

page 3

page 4


Almost Optimal Inapproximability of Multidimensional Packing Problems

Multidimensional packing problems generalize the classical packing probl...

Comparative Analysis of Box-Covering Algorithms for Fractal Networks

Research on fractal networks is a dynamically growing field of network s...

Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates

In the dynamic linear program (LP) problem, we are given an LP undergoin...

Moving intervals for packing and covering

We study several problems on geometric packing and covering with movemen...

Analysis of the Harmonic Function Used in Bin-Packing

The harmonic function was first introduced by Lee and Lee (JACM 1985) fo...

Approximation Algorithms for Two-Bar Charts Packing Problem

In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack t...

Streaming Algorithms for Bin Packing and Vector Scheduling

Problems involving the efficient arrangement of simple objects, as captu...