From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP.
Leonid GurvitsNathan KleinJonathan LeakePublished in: Electron. Colloquium Comput. Complex. (2023)
Keyphrases
- traveling salesman problem
- decision trees
- upper bound
- lower bound
- search space
- travelling salesman
- combinatorial optimization
- tight bounds
- worst case
- lower and upper bounds
- tree construction
- genetic algorithm
- ant colony optimization
- np hard
- error bounds
- piecewise polynomial
- optimal solution
- tree nodes
- high capacity
- tree models
- average case
- vc dimension
- tree structure
- multi class
- tree automata
- contingency tables
- tree structures
- compact representations
- upper and lower bounds
- binary trees
- hermite transform