An Efficient Approximate Algorithm for the 1-Median Problem on a Graph.
Koji TabataAtsuyoshi NakamuraMineichi KudoPublished in: IEICE Trans. Inf. Syst. (2017)
Keyphrases
- learning algorithm
- preprocessing
- optimal solution
- cost function
- computationally efficient
- computational complexity
- detection algorithm
- dynamic programming
- computational cost
- graph based algorithm
- breadth first search
- graph structure
- segmentation algorithm
- similarity measure
- experimental evaluation
- search space
- weighted graph
- adjacency graph
- solution path
- k means
- junction tree
- random graphs
- shortest path problem
- graph model
- expectation maximization
- significant improvement
- recognition algorithm
- graph matching
- matching algorithm
- tree structure
- np hard
- worst case