A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems.
Tesshu HanakaMasashi KiyomiYasuaki KobayashiYusuke KobayashiKazuhiro KuritaYota OtachiPublished in: AAAI (2023)
Keyphrases
- combinatorial problems
- approximation algorithms
- exact algorithms
- constraint programming
- np hard
- constraint satisfaction problems
- graph coloring
- phase transition
- metaheuristic
- traveling salesman problem
- special case
- approximation schemes
- constraint satisfaction
- vertex cover
- neural network
- constant factor
- optimal solution
- minimum cost
- combinatorial optimization
- cost function
- undirected graph
- benchmark problems
- solution space
- branch and bound algorithm
- feasible solution