Approximation Algorithms for a Triangle Enclosure Problem.
Karim DouïebMatthew EastmanAnil MaheshwariMichiel H. M. SmidPublished in: CCCG (2011)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- primal dual
- network design problem
- open shop
- facility location problem
- precedence constraints
- combinatorial auctions
- set cover
- approximation ratio
- constant factor
- disjoint paths
- approximation schemes
- undirected graph
- optimal solution
- randomized algorithms
- objective function