Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices.
Pavel DvorákAndreas Emil FeldmannDusan KnopTomás MasaríkTomás ToufarPavel VeselýPublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- steiner tree
- approximation schemes
- small number
- approximation algorithms
- undirected graph
- minimum spanning tree
- shortest path
- facility location
- weighted graph
- np hard
- bin packing
- edge weights
- linear programming relaxation
- minimum cost
- numerical methods
- traveling salesman problem
- directed graph
- particle swarm optimization
- simulated annealing
- image segmentation