Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View.
Radek HusekDusan KnopTomás MasaríkPublished in: IPEC (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- facility location problem
- network design problem
- worst case
- minimum cost
- approximation ratio
- open shop
- undirected graph
- set cover
- primal dual
- constant factor
- randomized algorithms
- disjoint paths
- integer programming
- precedence constraints
- lower bound
- np hardness
- linear program
- polynomial time approximation