Work

Low-Step Multi-commodity Flow Emulators

Year: 2024

Type: conference-paper

Abstract: We introduce the concept of low-step multi-commodity flow emulators for any undirected, capacitated graph. At a high level, these emulators contain approximate multi-commodity flows whose paths contain a small number of edges, shattering the infamous flow decomposition barrier for multi-commodity flow.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/3618260.3649689

Authors: Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak

Institutions: ETH Zurich, Carnegie Mellon University, Brown University, University of Michigan

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, European Commission, H2020 European Research Council

Awards: CAREER: Theory for Dynamic Graph Algorithms, Distributed Optimization Beyond Worst-Case Topologies, G434337789