An Experimental Comparison of Approximation Algorithms for the Shortest Common Superstring Problem.
Heidi J. RomeroCarlos A. BrizuelaAndrei TchernykhPublished in: ENC (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- shortest path
- minimum cost
- primal dual
- randomized algorithms
- facility location problem
- set cover
- exact algorithms
- np hardness
- approximation ratio
- network design problem
- combinatorial auctions
- constant factor
- approximation schemes
- polynomial time approximation
- open shop
- disjoint paths
- precedence constraints
- undirected graph
- integer programming
- resource allocation
- objective function