Academic Journal
Dynamic Maintenance of Monotone Dynamic Programs and Applications
| Τίτλος: | Dynamic Maintenance of Monotone Dynamic Programs and Applications |
|---|---|
| Συγγραφείς: | Henzinger, Monika, Neumann, Stefan, Räcke, Harald, Schmid, Stefan |
| Συνεισφορές: | Monika Henzinger and Stefan Neumann and Harald Räcke and Stefan Schmid, Berenbrink, Petra, Bouyer, Patricia, Dawar, Anuj, Kanté, Mamadou Moustapha |
| Publication Status: | Preprint |
| Στοιχεία εκδότη: | arXiv, 2023. |
| Έτος έκδοσης: | 2023 |
| Θεματικοί όροι: | Theory of computation → Dynamic graph algorithms, FOS: Computer and information sciences, data structures, dynamic algorithms, Computer Science - Data Structures and Algorithms, Theory of computation → Dynamic programming, Data Structures and Algorithms (cs.DS), ddc:004, Dynamic programming, Theory of computation → Packing and covering problems |
| Περιγραφή: | Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However, many DP algorithms have to fill in large DP tables, represented by two-dimensional arrays, which causes at least quadratic running times and space usages. This has led to the development of improved algorithms for special cases when the DPs satisfy additional properties like, e.g., the Monge property or total monotonicity. In this paper, we consider a new condition which assumes (among some other technical assumptions) that the rows of the DP table are monotone. Under this assumption, we introduce a novel data structure for computing $(1+\varepsilon)$-approximate DP solutions in near-linear time and space in the static setting, and with polylogarithmic update times when the DP entries change dynamically. To the best of our knowledge, our new condition is incomparable to previous conditions and is the first which allows to derive dynamic algorithms based on existing DPs. Instead of using two-dimensional arrays to store the DP tables, we store the rows of the DP tables using monotone piecewise constant functions. This allows us to store length-$n$ DP table rows with entries in $[0,W]$ using only polylog$(n,W)$ bits, and to perform operations, such as $(\min,+)$-convolution or rounding, on these functions in polylogarithmic time. We further present several applications of our data structure. For bicriteria versions of $k$-balanced graph partitioning and simultaneous source location, we obtain the first dynamic algorithms with subpolynomial update times, as well as the first static algorithms using only near-linear time and space. Additionally, we obtain the currently fastest algorithm for fully dynamic knapsack. shortened to comply with arxiv formatting rules. To appear at STACS'23 |
| Τύπος εγγράφου: | Article Conference object |
| Περιγραφή αρχείου: | application/pdf |
| DOI: | 10.48550/arxiv.2301.01744 |
| DOI: | 10.4230/lipics.stacs.2023.36 |
| Σύνδεσμος πρόσβασης: | http://arxiv.org/abs/2301.01744 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.36 |
| Rights: | arXiv Non-Exclusive Distribution CC BY |
| Αριθμός Καταχώρησης: | edsair.doi.dedup.....87416a0616de748b24c74da1e0514d67 |
| Βάση Δεδομένων: | OpenAIRE |
| DOI: | 10.48550/arxiv.2301.01744 |
|---|