The Parameterized Complexity of the Survivable Network Design Problem.
Andreas Emil FeldmannAnish MukherjeeErik Jan van LeeuwenPublished in: CoRR (2021)
Keyphrases
- network design problem
- parameterized complexity
- approximation algorithms
- network design
- branch and bound
- fixed parameter tractable
- transportation networks
- global constraints
- mixed integer programming
- minimal cost
- mixed integer
- integer programming
- np hard
- symmetry breaking
- lagrangian relaxation
- valid inequalities
- computational problems
- search space
- search algorithm
- search tree
- bayesian networks
- communication networks
- lp relaxation
- linear program
- special case