Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.
Martin KnauerJoachim SpoerhasePublished in: Algorithmica (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- spanning tree
- worst case
- facility location problem
- network design problem
- set cover
- open shop
- vertex cover
- primal dual
- integrality gap
- interval data
- exact algorithms
- undirected graph
- np hardness
- computational complexity
- disjoint paths
- approximation ratio
- randomized algorithms
- approximation schemes
- constant factor approximation
- precedence constraints
- combinatorial auctions
- branch and bound algorithm
- combinatorial optimization