Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs.
Ahmad BiniazPublished in: WALCOM (2021)
Keyphrases
- spanning tree
- approximation algorithms
- minimum cost
- minimum weight
- undirected graph
- maximum weight
- minimum spanning tree
- minimum spanning trees
- np hard
- edge disjoint
- independent set
- special case
- weighted graph
- worst case
- graph matching
- vertex cover
- bipartite graph
- edge weights
- directed graph
- planar graphs
- bayesian networks
- data objects
- collaborative filtering
- randomized algorithms