Approximation Algorithms for Sorting Permutations by Length-Weighted Short Rearrangements.
Alexsandro Oliveira AlexandrinoGuilherme Henrique Santos MirandaCarla Negri LintzmayerZanoni DiasPublished in: LAGOS (2019)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- longest common subsequence
- minimum cost
- approximation schemes
- facility location problem
- approximation ratio
- network design problem
- primal dual
- set cover
- constant factor
- randomized algorithms
- weighted sum
- np hardness
- open shop
- optimal solution
- disjoint paths
- undirected graph
- lower bound