An improved lower bound on identifying compelled edges in a DAG.
Dan WuPublished in: Computational Intelligence (2006)
Keyphrases
- lower bound
- directed acyclic graph
- upper bound
- worst case
- directed graph
- branch and bound algorithm
- lower and upper bounds
- polynomial approximation
- np hard
- objective function
- lower bounding
- upper and lower bounds
- branch and bound
- edge detector
- optimal solution
- weighted graph
- spanning tree
- data sets
- search space
- online algorithms
- competitive ratio
- branch and bound method
- e learning