Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree.
Wenjun LiYixin CaoJianer ChenJianxin WangPublished in: Inf. Comput. (2017)
Keyphrases
- approximation algorithms
- spanning tree
- minimum cost
- np hard
- minimum spanning tree
- undirected graph
- special case
- network flow
- vertex cover
- worst case
- set cover
- minimum spanning trees
- genetic algorithm
- approximation schemes
- search algorithm
- minimum weight
- optimal solution
- search space
- open shop
- primal dual
- combinatorial optimization
- tabu search
- approximation ratio
- disjoint paths
- combinatorial auctions
- constant factor
- minimum total cost
- integrality gap
- randomized algorithms
- linear programming
- precedence constraints
- memetic algorithm
- simulated annealing
- scheduling problem
- tree structure
- edge weights
- weighted graph