(p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective.
Igor AverbakhOded BermanPublished in: Discret. Appl. Math. (1997)
Keyphrases
- optimization problems
- approximate solutions
- exact and approximate
- orders of magnitude
- benchmark problems
- difficult problems
- learning algorithm
- specific problems
- problems in computer vision
- computational complexity
- run times
- test problems
- tree mining
- computational problems
- theoretical guarantees
- exact solution
- search methods
- tree structure
- exact algorithms
- combinatorial optimization
- theoretical analysis
- computational cost
- query processing
- data structure