A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.
Tesshu HanakaMasashi KiyomiYasuaki KobayashiYusuke KobayashiKazuhiro KuritaYota OtachiPublished in: CoRR (2022)
Keyphrases
- combinatorial problems
- approximation algorithms
- exact algorithms
- constraint programming
- combinatorial optimization
- special case
- graph coloring
- traveling salesman problem
- graph colouring
- np hard
- worst case
- constraint satisfaction problems
- phase transition
- computational complexity
- vertex cover
- constraint satisfaction
- optimization problems
- benchmark problems
- solution space
- undirected graph
- knapsack problem
- metaheuristic
- combinatorial search
- solving hard
- optimal solution