From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP.
Leonid GurvitsNathan KleinJonathan LeakePublished in: CoRR (2023)
Keyphrases
- traveling salesman problem
- upper bound
- lower bound
- worst case
- lower and upper bounds
- search space
- upper and lower bounds
- np hard
- genetic algorithm
- optimization problems
- travelling salesman
- tree structure
- error bounds
- low order
- capacity expansion
- neural network
- algebraic geometry
- hermite transform
- combinatorial optimization
- ant colony optimization
- decision trees
- data sets
- tree patterns
- relational databases
- optimal solution
- tree construction
- tight bounds
- objective function
- machine learning
- worst case bounds
- piecewise polynomial
- document identifiers