All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs

DOI10.1109/FOCS.2013.28MaRDI QIDQ6981757zbMATH OpenFDO

Authors Ken-ichi Kawarabayashi, Yusuke Kobayashi

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.28

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

• Fair k-center clustering with minimum representation guarantees

This page was built for publication: All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981757)