Finding Short Paths on Polytopes by the Shadow Vertex Algorithm.
Tobias BrunschHeiko RöglinPublished in: ICALP (1) (2013)
Keyphrases
- times faster
- search space
- experimental evaluation
- preprocessing
- improved algorithm
- optimization algorithm
- convex hull
- learning algorithm
- path finding
- computational complexity
- cost function
- dynamic programming
- convergence rate
- path planning
- matching algorithm
- detection algorithm
- theoretical analysis
- high accuracy
- worst case
- undirected graph
- objective function
- hamiltonian cycle
- particle swarm optimization
- bipartite graph
- computational cost
- np hard
- search algorithm
- similarity measure