Linear time algorithms for NP-hard problems restricted to partial k-trees.

Stefan Arnborg Andrzej Proskurowski

Published in: Discret. Appl. Math. (1989)

Keyphrases

np hard problems
worst case
constraint programming
knapsack problem
data structure
np hard
optimization problems
combinatorial search
combinatorial optimization problems
linear programming
orders of magnitude
search methods