Metraipolis › archive › dc_3b618dd49cb8

Multiplicative Weights for Mixed Block Constraints and Maximum Multicommodity Flow — arXiv:2611.01920

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01920
License (as archived)
CC0-1.0
Archived
2026-11-03T11:45:41.302Z
SHA-256 of the archived text
32090637d8f7f5b0798d12ab89d8c44013521aa422d9baf8543cf8a44ed786ea
Stable URL of this page
https://metraipolis.com/documento/dc_3b618dd49cb8

How to cite

Multiplicative Weights for Mixed Block Constraints and Maximum Multicommodity Flow — arXiv:2611.01920 — arXiv (en), https://arxiv.org/abs/2611.01920 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3b618dd49cb8 (Metraipolis archive dc_3b618dd49cb8, sha256 32090637d8f7f5b0798d12ab89d8c44013521aa422d9baf8543cf8a44ed786ea)
BibTeX
@misc{dc3b618dd49cb8,
  title = {Multiplicative Weights for Mixed Block Constraints and Maximum Multicommodity Flow — arXiv:2611.01920},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01920},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3b618dd49cb8; sha256 32090637d8f7f5b0798d12ab89d8c44013521aa422d9baf8543cf8a44ed786ea},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01920. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study multiplicative-weights (MWU) algorithms for block-separable feasibility problems containing both packing and covering constraints. Each iteration optimizes a weighted linear objective over one block, either chosen uniformly at random or visited in a fixed cyclic order. We show that the cyclic algorithm returns an $O(\varepsilon)$-approximate solution after $O(k\rho\varepsilon^{-2}\log m)$ oracle calls where $k$ is the number of blocks and $\rho$ is the width of the oracle. The same holds for the randomized version with high probability. Previously, such bounds were shown when the coupling constraints have the same sign [Radzik'95; Villavicencio-Grigoriadis'96]. These analyses critically depended on monotonicity arguments that are not available in the mixed case. As an application, we obtain a deterministic $(1-\varepsilon)$-approximation for maximum multicommodity flow (M-MCF) using $O(k\varepsilon^{-2}\log m\log(km/\varepsilon))$ approximate single-commodity min-cost-flow calls. For planar graphs, and more generally for graph families admitting a near-linear-time min-cost-flow algorithm, this gives total running time $\widetilde O(km\varepsilon^{-2})$. Compared with the $O(km^{1+o(1)}\varepsilon^{-1})$ algorithm of [Chen-Graur-Sidford'25], this improves the dependence on $m$ for these graph families at the cost of a worse dependence on $\varepsilon$. Finally, we give an exponentiation-free finite-precision implementation of the cyclic algorithm. It represents each internal weight by a logarithmic-bit mantissa and exponent, while every price supplied to the block oracle is rational and has a polynomially bounded common denominator.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.01920 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:07:52.241Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).