Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees.
Wenjun LiJianer ChenJianxin WangPublished in: ESA (2014)
Keyphrases
- spanning tree
- minimum cost
- edge disjoint
- minimum spanning tree
- approximation algorithms
- minimum spanning trees
- search algorithm
- memetic algorithm
- optimal solution
- approximation error
- search space
- combinatorial optimization
- undirected graph
- np hard
- depth first search
- closed form
- global search
- tabu search
- simulated annealing
- search procedure
- error bounds
- total length
- high level
- probabilistic model
- relative error
- computational complexity
- stochastic local search
- data structure