An efficient graph algorithm for dominance constraints.
Ernst AlthausDenys DuchierAlexander KollerKurt MehlhornJoachim NiehrenSven ThielPublished in: J. Algorithms (2003)
Keyphrases
- detection algorithm
- learning algorithm
- computational complexity
- computationally efficient
- dynamic programming
- optimal solution
- shortest path problem
- linear programming
- np hard
- preprocessing
- multiple constraints
- spanning tree
- constrained optimization
- cost function
- computational cost
- recognition algorithm
- dominating set
- maximum flow
- weighted graph
- graph structure
- particle swarm optimization
- worst case
- tree structure
- bipartite graph
- graph theory
- ant colony optimization
- search space
- random walk
- expectation maximization
- simulated annealing
- maximum weight
- rough sets
- polynomial time complexity