On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
DOI10.1016/j.tcs.2017.07.027zbMath1374.68039OpenAlexW2740329872MaRDI QIDQ2402675
Lin Chen, Shurong Zhang, Weihua Yang
Publication date: 13 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.027
fully polynomial-time approximation algorithmsmulti-channel wireless networksvertex- and channel-disjoint paths
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of finding two disjoint paths with min-max objective function
- A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
- Constructing disjoint paths on expander graphs
- An improved FPTAS for Restricted Shortest Path.
- Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax \(k\) vertex-disjoint paths in a directed acyclic graph
- Heuristics for finding a maximum number of disjoint bounded paths
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Fast Approximation Algorithms for Knapsack Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Disjoint paths in a network
- Algorithms for Scheduling Independent Tasks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Combinatorial Problems: Reductibility and Approximation
- The complexity of finding maximum disjoint paths with length constraints
- Efficient Algorithms for k-Disjoint Paths Problems on DAGs
- Digraphs
- A simple efficient approximation scheme for the restricted shortest path problem
This page was built for publication: On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
