Approximation algorithms for the rectilinear Steiner tree problem with obstacles.
Makoto FujimotoDaisuke TakafujiToshimasa WatanabePublished in: ISCAS (2) (2005)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- approximation schemes
- vertex cover
- network design problem
- prize collecting
- primal dual
- exact algorithms
- set cover
- constant factor
- randomized algorithms
- np hardness
- facility location problem
- open shop
- precedence constraints
- approximation ratio
- undirected graph
- disjoint paths
- theoretical analysis