Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average-degrees.
FNU SharifulJustin WeathersAnirban GhoshGiri NarasimhanPublished in: CoRR (2023)
Keyphrases
- dynamic programming
- computational complexity
- learning algorithm
- detection algorithm
- preprocessing
- search space
- experimental evaluation
- computational cost
- np hard
- optimization algorithm
- expectation maximization
- cost function
- globally optimal
- minimum spanning tree
- space complexity
- particle swarm optimization
- weighted graph
- spanning tree
- graph construction
- graph isomorphism
- greedy algorithm
- matching algorithm
- segmentation algorithm
- worst case
- significant improvement
- k means
- bayesian networks