-Level Crossing Minimization Is NP-Hard for Trees.
Martin HarriganPatrick HealyPublished in: WALCOM (2011)
Keyphrases
- np hard
- decision trees
- optimal solution
- np complete
- linear programming
- np hardness
- branch and bound algorithm
- scheduling problem
- approximation algorithms
- computational complexity
- objective function
- remains np hard
- special case
- decision problems
- greedy heuristic
- minimum cost
- integer programming
- tree automata
- knapsack problem
- constraint satisfaction problems
- tree structures
- worst case
- tree models
- binary trees
- tree structure
- tree construction
- database
- closely related
- case study
- neural network