On the Approximability of Robust Network Design
Yacine Al-Najjar, and Walid Ben-Ameur, Jeremie Leguay

TL;DR
This paper investigates the computational complexity of robust network design, proving strong inapproximability results and establishing tight bounds for approximation ratios, thereby resolving open questions and clarifying the limits of efficient algorithms.
Contribution
It proves that the robust network design problem with minimum congestion cannot be approximated within any constant factor, and establishes tight bounds matching known algorithms, resolving longstanding open problems.
Findings
Robust network design with minimum congestion is hard to approximate within any constant.
The $O(rac{ ext{log} n}{ ext{log} ext{log} n})$ lower bound matches the $O( ext{log} n)$ approximation ratio.
Linear reservation cost problem cannot be approximated within any constant ratio.
Abstract
Given the dynamic nature of traffic, we investigate the variant of robust network design where we have to determine the capacity to reserve on each link so that each demand vector belonging to a polyhedral set can be routed. The objective is either to minimize congestion or a linear cost. Routing is assumed to be fractional and dynamic (i.e., dependent on the current traffic vector). We first prove that the robust network design problem with minimum congestion cannot be approximated within any constant factor. Then, using the ETH conjecture, we get a lower bound for the approximability of this problem. This implies that the well-known approximation ratio established by R\"{a}cke in 2008 is tight. Using Lagrange relaxation, we obtain a new proof of the approximation. An important consequence of the Lagrange-based reduction and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
