@InProceedings{carpenter_et_al:LIPIcs.APPROX-RANDOM.2019.14,
  author =	{Carpenter, Timothy and Salmasi, Ario and Sidiropoulos, Anastasios},
  title =	{{Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
  pages =	{14:1--14:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-125-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{145},
  editor =	{Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.14},
  URN =		{urn:nbn:de:0030-drops-112290},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2019.14},
  annote =	{Keywords: Routing, Node-disjoint, Symmetric demands, Minor-free graphs}
}