Novel successive-approximation algorithms.
Harri LampinenPauli PeräläOlli VainioPublished in: ISCAS (1) (2005)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- network design problem
- minimum cost
- exact algorithms
- constant factor
- np hardness
- set cover
- open shop
- approximation schemes
- precedence constraints
- randomized algorithms
- combinatorial auctions
- disjoint paths
- undirected graph
- primal dual
- constant factor approximation