Approximation algorithms for Steiner forest: An experimental study.
Laleh GhalamiDaniel GrosuPublished in: Networks (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- approximation ratio
- worst case
- vertex cover
- facility location problem
- open shop
- approximation schemes
- network design problem
- set cover
- exact algorithms
- constant factor
- primal dual
- np hardness
- approximation guarantees
- precedence constraints
- undirected graph
- minimum spanning tree
- optimal solution