Design of Dynamic Algorithms via PrimalDual Method
Abstract
We develop a dynamic version of the primaldual method for optimization problems, and apply it to obtain the following results. (1) For the dynamic setcover problem, we maintain an $O(f^2)$approximately optimal solution in $O(f \cdot \log (m+n))$ amortized update time, where $f$ is the maximum "frequency" of an element, $n$ is the number of sets, and $m$ is the maximum number of elements in the universe at any point in time. (2) For the dynamic $b$matching problem, we maintain an $O(1)$approximately optimal solution in $O(\log^3 n)$ amortized update time, where $n$ is the number of nodes in the graph.
 Publication:

arXiv eprints
 Pub Date:
 April 2016
 arXiv:
 arXiv:1604.05337
 Bibcode:
 2016arXiv160405337B
 Keywords:

 Computer Science  Data Structures and Algorithms
 EPrint:
 A preliminary version of this paper appeared in ICALP 2015 (Track A)