Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.
Sayan BandyapadhyayWilliam LochetDaniel LokshtanovSaket SaurabhJie XuePublished in: SODA (2024)
Keyphrases
- steiner tree
- fixed parameter tractable
- parameterized complexity
- computational problems
- np hard
- np complete
- shortest path
- minimum spanning tree
- global constraints
- facility location
- conjunctive queries
- bounded treewidth
- linear programming relaxation
- abstract argumentation
- approximation algorithms
- knapsack problem
- computational complexity
- vertex set
- constraint propagation
- network design
- graph theory
- linear programming
- query language
- evolutionary algorithm
- lower bound