58 search results - page 8 / 12 » Fast Approximation Algorithms for Fractional Packing and Cov... |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
ICALP
2005
Springer
14 years 6 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
STOC
1999
ACM
13 years 11 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
TAMC
2007
Springer
14 years 24 days ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
PODC
2005
ACM
14 years 8 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...