1 citations · 1 across the 3 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos
The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undir…
cs.DS2017
On constant multi-commodity flow-cut gaps for directed minor-free graphs
Ario Salmasi, Anastasios Sidiropoulos, Vijay Sridhar
The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various class…