The Parameterized Complexity of the Survivable Network Design Problem.
Andreas Emil FeldmannAnish MukherjeeErik Jan van LeeuwenPublished in: SOSA (2022)
Keyphrases
- network design problem
- parameterized complexity
- network design
- approximation algorithms
- branch and bound
- fixed parameter tractable
- global constraints
- integer programming
- mixed integer programming
- minimal cost
- transportation networks
- lagrangian relaxation
- np hard
- valid inequalities
- mixed integer
- symmetry breaking
- search algorithm
- lower bound
- branch and bound algorithm
- lp relaxation
- communication networks
- feasible solution