On multi-path routing for reliable communications in failure interdependent complex networks
From MaRDI portal
Publication:2025105
DOI10.1007/s10878-020-00665-2zbMath1468.90118OpenAlexW3105480889MaRDI QIDQ2025105
Zishen Yang, Donghyun Kim, Wei Wang
Publication date: 11 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00665-2
hardness of approximationmulti-path routing\( \mathcal{NP} \)-hardmaximum non-disrupting paths problemsmart grid communication network
Cites Work
- Unnamed Item
- Unnamed Item
- Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
- Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- On interdependent failure resilient multi-path routing in smart grid communication network
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Some Generalized Max-Flow Min-Cut Problems in the Plane
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Computing and Combinatorics
- Algorithms and Computation
