Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths.
Surender BaswanaTelikepalli KavithaPublished in: FOCS (2006)
Keyphrases
- times faster
- orders of magnitude
- significant improvement
- data structure
- benchmark datasets
- computational cost
- recently developed
- computationally expensive
- theoretical analysis
- neural network
- small number
- pairwise
- computational complexity
- approximate solutions
- optimization problems
- combinatorial optimization
- graph theory
- highly efficient
- computationally efficient
- knn
- search algorithm
- decision trees
- search engine