Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem.
Martin KnauerJoachim SpoerhasePublished in: WADS (2009)
Keyphrases
- approximation algorithms
- special case
- np hard
- minimum cost
- spanning tree
- vertex cover
- worst case
- primal dual
- approximation ratio
- np hardness
- network design problem
- facility location problem
- approximation schemes
- interval data
- open shop
- integrality gap
- set cover
- undirected graph
- exact algorithms
- optimal solution
- constant factor
- randomized algorithms