On Exact and Approximation Algorithms for Distinguishing Substring Selection.
Jens GrammJiong GuoRolf NiedermeierPublished in: FCT (2003)
Keyphrases
- approximation algorithms
- np hard
- special case
- network design problem
- vertex cover
- minimum cost
- worst case
- closest string
- exact algorithms
- primal dual
- precedence constraints
- np hardness
- randomized algorithms
- facility location problem
- set cover
- constant factor approximation
- open shop
- constant factor
- approximation ratio
- approximation schemes
- exact solution
- disjoint paths
- linear programming
- search algorithm
- undirected graph
- combinatorial auctions