Hardness Results and Approximation Algorithms for the Minimum Dominating Tree Problem.
Gilad KutielPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- minimum cost
- np hard
- constant factor
- spanning tree
- np hardness
- worst case
- special case
- vertex cover
- facility location problem
- set cover
- network design problem
- tree structure
- computational complexity
- undirected graph
- upper bound
- primal dual
- exact algorithms
- branch and bound algorithm
- network flow
- disjoint paths
- open shop
- lower bound
- randomized algorithms
- greedy algorithm
- constraint satisfaction problems
- phase transition
- np complete
- optimal solution
- strongly np hard
- constant factor approximation
- polynomial time approximation
- approximation ratio
- linear programming
- theoretical analysis
- precedence constraints