Approximation Algorithms for Connected Graph Factors of Minimum Weight.
Kamiel CornelissenRuben HoeksmaBodo MantheyN. S. NarayanaswamyC. S. RahulMarten WaandersPublished in: Theory Comput. Syst. (2018)
Keyphrases
- approximation algorithms
- minimum weight
- spanning tree
- minimum cost
- bipartite graph
- weighted graph
- np hard
- greedy heuristic
- minimum spanning tree
- maximum weight
- maximum cardinality
- special case
- vertex cover
- undirected graph
- planar graphs
- worst case
- connected components
- approximation ratio
- edge weights
- constant factor
- disjoint paths
- randomized algorithm
- scheduling problem
- branch and bound algorithm
- directed graph
- shortest path
- optimal solution
- constant factor approximation
- lower bound
- computational complexity