Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422)
This report documents the program and the outcomes of Dagstuhl Seminar 23422 "Graph Algorithms: Cuts, Flows, and Network Design". This seminar brought 25 leading researchers in graph algorithms together for a discussion of the recent progress and challenges in two areas: the design of fast algorithm for fundamental flow/cut problems and the design of approximation algorithms for basic network design problems. The seminar included several talks of varying lengths, a panel discussion, and an open problem session. In addition, sufficient time was set aside for research discussions and collaborations.
approximation
graph algorithm
maximum flow
minimum cut
network design
Theory of computation~Graph algorithms analysis
Theory of computation~Network flows
76-89
Regular Paper
Jason
Li
Jason Li
University of California - Berkeley, US
Debmalya
Panigrahi
Debmalya Panigrahi
Duke University - Durham, US
Laura
Sanita
Laura Sanita
Università Bocconi - Milan, IT
Thatchaphol
Saranurak
Thatchaphol Saranurak
University of Michigan - Ann Arbor, US
10.4230/DagRep.13.10.76
Jason Li, Debmalya Panigrahi, Laura Sanita, and Thatchaphol Saranurak
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode