An Improved Meet in the Middle Algorithm for Graphs with Unit Costs.
Edward C. SewellJohn PavlikSheldon H. JacobsonPublished in: SOCS (2019)
Keyphrases
- times faster
- optimization algorithm
- np hard
- learning algorithm
- dynamic programming
- experimental evaluation
- theoretical analysis
- probabilistic model
- high accuracy
- input data
- random graphs
- matching algorithm
- clustering method
- computational cost
- search space
- optimal solution
- segmentation algorithm
- significant improvement
- k means
- recognition algorithm
- improved algorithm
- graph partitioning
- graph clustering
- objective function