13 citations · 16 across the 3 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018
Tight Approximation Ratio for Minimum Maximal Matching
Szymon Dudycz, Mateusz Lewandowski, Jan Marcinkowski
We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is…
cs.DS2018★ 1 cited
Short Schedules for Fast Flow Rerouting
Saeed Akhoondian Amiri, Szymon Dudycz, Mahmoud Parham +2
This paper studies the fundamental problem of how to reroute unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new pa…