@Article{li_et_al:DagRep.13.10.76,
  author =	{Li, Jason and Panigrahi, Debmalya and Sanita, Laura and Saranurak, Thatchaphol},
  title =	{{Graph Algorithms: Cuts, Flows, and Network Design (Dagstuhl Seminar 23422)}},
  pages =	{76--89},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2024},
  volume =	{13},
  number =	{10},
  editor =	{Li, Jason and Panigrahi, Debmalya and Sanita, Laura and Saranurak, Thatchaphol},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.10.76},
  URN =		{urn:nbn:de:0030-drops-198357},
  doi =		{10.4230/DagRep.13.10.76},
  annote =	{Keywords: approximation, graph algorithm, maximum flow, minimum cut, network design}
}