Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles.
Thomas Dueholm HansenUri ZwickPublished in: ISAAC (1) (2010)
Keyphrases
- lower bound
- np hard
- learning algorithm
- objective function
- computational cost
- times faster
- optimization algorithm
- optimal solution
- probabilistic model
- theoretical analysis
- detection algorithm
- cost function
- constant factor
- computational complexity
- optimal cost
- minimum cost
- square error
- expectation maximization
- worst case
- dynamic programming
- preprocessing
- similarity measure
- linear programming
- upper bound
- matching algorithm
- memory requirements
- search space
- network flow
- memory efficient
- min sum
- neural network