Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable.
Sayan BandyapadhyayWilliam LochetDaniel LokshtanovSaket SaurabhJie XuePublished in: CoRR (2023)
Keyphrases
- steiner tree
- fixed parameter tractable
- parameterized complexity
- computational problems
- np hard
- np complete
- minimum spanning tree
- facility location
- global constraints
- bounded treewidth
- shortest path
- linear programming relaxation
- conjunctive queries
- abstract argumentation
- integer programming
- lower bound
- worst case
- knapsack problem
- scheduling problem
- special case