Approximation algorithms for sorting by length-weighted prefix and suffix operations.
Carla Negri LintzmayerGuillaume FertinZanoni DiasPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- network design problem
- randomized algorithms
- data structure
- approximation ratio
- longest common subsequence
- facility location problem
- open shop
- set cover
- primal dual
- combinatorial auctions
- approximation schemes
- prefix tree
- np hardness
- suffix tree
- precedence constraints
- undirected graph
- polynomial time approximation
- weighted graph
- theoretical analysis
- genetic algorithm