Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations.
Alexsandro Oliveira AlexandrinoCarla Negri LintzmayerZanoni DiasPublished in: AlCoB (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- primal dual
- minimum cost
- approximation ratio
- network design problem
- facility location problem
- open shop
- randomized algorithms
- constant factor
- weighted sum
- disjoint paths
- exact algorithms
- linear programming
- dynamic programming
- np hardness
- linear program
- upper bound
- polynomial time approximation
- computational complexity
- genetic algorithm