Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs.

Marc Hellmuth Guillaume E. Scholz

Published in: COCOON (1) (2023)

Keyphrases

np hard problems
constraint programming
orders of magnitude
knapsack problem
np hard
worst case
graph coloring
genetic algorithm
combinatorial problems
combinatorial optimization
computational complexity
optimization problems
genetic programming
heuristic search
graph structure
constraint propagation