On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters

DOI10.1007/978-3-642-38016-7_5zbMath1394.68181OpenAlexW2197072678MaRDI QIDQ2848912

Mordechai Shalom, Itamar Hartstein, Shmuel Zaks

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_5

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Regenerator location problem: polyhedral study and effective branch-and-cut algorithms

This page was built for publication: On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters