Approximation Algorithms for Sorting λ-Permutations by λ-Operations.
Guilherme Henrique Santos MirandaAlexsandro Oliveira AlexandrinoCarla Negri LintzmayerZanoni DiasPublished in: Algorithms (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- network design problem
- approximation schemes
- constant factor
- approximation ratio
- open shop
- np hardness
- set cover
- exact algorithms
- primal dual
- constant factor approximation
- lower bound
- approximation guarantees
- randomized algorithms
- polynomial time approximation
- undirected graph
- integer programming
- linear programming
- search space