Parameterized Approximation Algorithms for Bidirected Steiner Network Problems.
Rajesh ChitnisAndreas Emil FeldmannPasin ManurangsiPublished in: ACM Trans. Algorithms (2021)
Keyphrases
- approximation algorithms
- vertex cover
- network design problem
- special case
- np hardness
- exact algorithms
- np hard
- approximation schemes
- randomized algorithms
- worst case
- complex networks
- approximation ratio
- wireless sensor networks
- open shop
- network structure
- mathematical model
- optimization problems
- set cover
- facility location problem
- disjoint paths