The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems.
Marc DemangeVangelis Th. PaschosPublished in: Comput. Optim. Appl. (1997)
Keyphrases
- combinatorial problems
- constraint programming
- combinatorial optimization
- solving hard
- graph coloring
- constraint satisfaction problems
- maximum independent set
- specific problems
- constraint satisfaction
- phase transition
- graph colouring
- traveling salesman problem
- combinatorial search
- metaheuristic
- hard combinatorial optimization problems
- bin packing
- satisfiability problem
- graph theoretic
- graph theory
- genetic algorithm
- branch and bound algorithm
- special case
- reinforcement learning