Approximation Algorithms for the Maximum Internal Spanning Tree Problem.
Gábor SalamonPublished in: MFCS (2007)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- spanning tree
- worst case
- facility location problem
- approximation schemes
- approximation ratio
- open shop
- np hardness
- exact algorithms
- integrality gap
- network design problem
- randomized algorithms
- interval data
- set cover
- precedence constraints
- undirected graph
- constant factor
- primal dual
- disjoint paths
- minimum spanning tree
- combinatorial auctions
- theoretical analysis
- constant factor approximation