Project Heads
Martin Skutella, Philipp Warode
Project Members
Srinwanti Debgupta
Project Duration
01.07.2025 – 30.06.2028
Located at
TU Berlin
Network flow theory concerns the optimal routing of commodities through networks and is fundamental to a wide range of application fields such as traffic, logistics, and computer networking. In many practical scenarios, splitting a commodity across multiple paths may degrade the quality of service, increase system complexity, or be simply infeasible. This motivates unsplittable multiflows. Here, for a given digraph with source-sink pairs, the demand of every commodity must be sent along a single path from its source to its sink. This project aims to advance our fundamental and algorithmic understanding of various unsplittable flow problems.
Project Webpages
Related Publications
Selected Pictures
Please insert any kind of pictures (photos, diagramms, simulations, graphics) related to the project in the above right field (Image with Text), by choosing the green plus image on top of the text editor. (You will be directed to the media library where you can add new files.)
(We need pictures for a lot of purposes in different contexts, like posters, scientific reports, flyers, website,…
Please upload pictures that might be just nice to look at, illustrate, explain or summarize your work.)
As Title in the above form please add a copyright.
And please give a short description of the picture and the context in the above textbox.
Don’t forget to press the “Save changes” button at the bottom of the box.
If you want to add more pictures, please use the “clone”-button at the right top of the above grey box.