Approximation algorithms for sorting by k-cuts on signed permutations.
Andre Rodrigues OliveiraAlexsandro Oliveira AlexandrinoGéraldine JeanGuillaume FertinUlisses DiasZanoni DiasPublished in: J. Comb. Optim. (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- network design problem
- minimum cost
- worst case
- facility location problem
- randomized algorithms
- approximation ratio
- set cover
- vertex cover
- approximation schemes
- open shop
- exact algorithms
- combinatorial auctions
- disjoint paths
- precedence constraints
- constant factor approximation
- np hardness
- undirected graph
- scheduling problem
- polynomial time approximation
- genetic algorithm
- primal dual
- search space