Metraipolis › archive › dc_82da43cdbef1

A Family of Well-Behaved Multiflow Instances — arXiv:2611.03858

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03858
License (as archived)
CC0-1.0
Archived
2026-11-04T19:06:56.454Z
SHA-256 of the archived text
cab0e46609e5136926c31f832a219aff19e2763759b112050527197588fcbc27
Stable URL of this page
https://metraipolis.com/documento/dc_82da43cdbef1

How to cite

A Family of Well-Behaved Multiflow Instances — arXiv:2611.03858 — arXiv (en), https://arxiv.org/abs/2611.03858 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_82da43cdbef1 (Metraipolis archive dc_82da43cdbef1, sha256 cab0e46609e5136926c31f832a219aff19e2763759b112050527197588fcbc27)
BibTeX
@misc{dc82da43cdbef1,
  title = {A Family of Well-Behaved Multiflow Instances — arXiv:2611.03858},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03858},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_82da43cdbef1; sha256 cab0e46609e5136926c31f832a219aff19e2763759b112050527197588fcbc27},
  year = {2026}
}

Archived text

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

We introduce a family of cut-sufficient instances for undirected multiflow that generalizes single-source planar and fully-planar instances. We also show the family has an additive $6 d_{\max}$ error for converting a fractional flow into an unsplittable one.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2611.03858 — 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-04T18:40:52.422Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).