Login / Signup
On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the theta-Function.
Etienne de Klerk
Dmitrii V. Pasechnik
Joost P. Warners
Published in:
J. Comb. Optim. (2004)
Keyphrases
</>
graph colouring
optimization problems
worst case
learning algorithm
data structure
piecewise linear
special case
orders of magnitude
optimal solution
computational complexity
lower bound
search space
neural network
cellular automata
heuristic search
constraint satisfaction
r tree
bin packing