Polynomial time algorithms for some minimum latency problems.
Bang Ye WuPublished in: Inf. Process. Lett. (2000)
Keyphrases
- optimization problems
- test problems
- related problems
- significant improvement
- difficult problems
- computational problems
- special case
- data structure
- hard problems
- worst case
- computationally efficient
- orders of magnitude
- combinatorial optimization problems
- iterative algorithms
- exact algorithms
- computationally hard
- benchmark problems
- search methods
- upper bound
- computational cost
- distributed constraint optimization
- learning algorithm
- data sets
- convex optimization problems
- np hard problems
- min sum
- global minima
- problems in computer vision
- approximate solutions
- practical problems
- heuristic methods
- combinatorial optimization
- data mining techniques
- np hard
- data mining