Metraipolis › archive › dc_d503b8841290

Sublinear Approximations for Spanning Tree Congestion — arXiv:2611.06209

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06209
License (as archived)
CC0-1.0
Archived
2026-11-05T18:31:37.544Z
SHA-256 of the archived text
c6a2258182f36325b99a5d9d27a32294365fb6a48d031126e5063f2e6f134871
Stable URL of this page
https://metraipolis.com/documento/dc_d503b8841290

How to cite

Sublinear Approximations for Spanning Tree Congestion — arXiv:2611.06209 — arXiv (en), https://arxiv.org/abs/2611.06209 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d503b8841290 (Metraipolis archive dc_d503b8841290, sha256 c6a2258182f36325b99a5d9d27a32294365fb6a48d031126e5063f2e6f134871)
BibTeX
@misc{dcd503b8841290,
  title = {Sublinear Approximations for Spanning Tree Congestion — arXiv:2611.06209},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06209},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d503b8841290; sha256 c6a2258182f36325b99a5d9d27a32294365fb6a48d031126e5063f2e6f134871},
  year = {2026}
}

Archived text

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

The spanning tree congestion of a connected graph \(G\) is the minimum, over all spanning trees \(T\) of \(G\), of the maximum number of edges of \(G\) crossing a cut induced by deleting an edge of \(T\). In the spanning tree congestion problem we are asked to compute a spanning tree with minimum congestion. We describe two sublinear-ratio approximation algorithms for the spanning tree congestion problem (STC): a simple $\Ot(n^{8/9})$-approximation, and a more involved $\Ot(n^{2/3})$-approximation, where the notation $\Ot$ hides factors polynomial in $\log n$.. Until now, no algorithm with sublinear ratio was known. We also prove that for any fixed $0<\varepsilon<1$, approximation of the spanning tree congestion within $2-\varepsilon$ is NP-hard. This improves the previous best known lower bound $6/5$.

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.06209 — 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-05T18:21:04.027Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).