DagRep.13.10.76.pdf
- Filesize: 2 MB
- 14 pages
Document
Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 13, Issue 10
Volume: Dagstuhl Reports, Volume 13
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-04-08
Cite AsGet BibTex
Jason Li, Debmalya Panigrahi, Laura Sanita, and Thatchaphol Saranurak. Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422). In Dagstuhl Reports, Volume 13, Issue 10, pp. 76-89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/DagRep.13.10.76
https://doi.org/10.4230/DagRep.13.10.76
Abstract
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Graph algorithms analysis
- Theory of computation → Network flows
Keywords
- approximation
- graph algorithm
- maximum flow
- minimum cut
- network design
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads