In this work, we mainly focus on the approximability of robust network design problems under dynamic routing in directed networks, while minimizing either ...
scholar.google.com › citations
Jan 23, 2023 · In this work, we mainly focus on the approximability of robust network design problems under dynamic routing in directed networks, while ...
Mar 9, 2022 · We consider robust network design problems where an uncertain traffic vector belonging to a polytope has to be dynamically routed to minimize ...
We consider robust network design problems where an uncertain traffic vector belonging to a polytope has to be dynamically routed to minimize either the ...
Approximability of Robust Network Design: The Directed Case
www.semanticscholar.org › paper › Appr...
It is proved that an O ( √ k ) = O ( n )-approximation can be obtained by solving the problem under static routing by solving the problem under static ...
Sep 25, 2020 · We first prove that the robust network design problem with minimum congestion cannot be approximated within any constant factor.
Missing: Directed Case.
Mar 8, 2021 · We first prove that the robust network design problem with minimum congestion cannot be approximated within any constant factor.
buy-at-bulk network design problem can be obtained as a special case of robust network design. RND was only known to be APX-hard (since the Steiner tree ...
Approximability of Robust Network Design: The Directed Case. pdf-format: LIPIcs-STACS-2022-6.pdf (1 MB). Abstract. We consider robust network design problems ...
buy-at-bulk network design problem can be obtained as a special case of robust network design. ... directed H-topes admits an O415-approximation.