The point-to-point delivery and connection problems: complexity and algorithms.
Chung-Lun LiS. Thomas McCormickDavid Simchi-LeviPublished in: Discret. Appl. Math. (1992)
Keyphrases
- worst case
- optimization problems
- high computational complexity
- problems in computer vision
- data structure
- search methods
- decision problems
- complexity bounds
- run times
- difficult problems
- related problems
- theoretical analysis
- computational complexity
- np hard problems
- computational problems
- hard problems
- space complexity
- benchmark problems
- computational cost
- learning algorithm
- complexity analysis
- computational issues
- practical problems
- significant improvement
- combinatorial optimization
- times faster
- exact algorithms
- greedy algorithms
- exact and approximate
- lower complexity
- combinatorial problems
- computationally hard
- specific problems
- computational geometry
- approximate solutions
- test problems
- linear programming
- multi class
- state space
- np hard
- decision trees