Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion

Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos. Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Authors

Timothy Carpenter

This author has not been identified. Look up 'Timothy Carpenter' in Google

Ario Salmasi

This author has not been identified. Look up 'Ario Salmasi' in Google

Anastasios Sidiropoulos

This author has not been identified. Look up 'Anastasios Sidiropoulos' in Google