Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree

DOI10.1007/978-3-642-41392-6_12zbMath1319.90073OpenAlexW105146165MaRDI QIDQ2856138

Kord Eickmeyer, Ken-ichi Kawarabayashi

Publication date: 23 October 2013

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41392-6_12

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of game theory (91A80) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree