Login / Signup
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems.
Chandra Chekuri
Kent Quanrud
Manuel R. Torres
Published in:
CoRR (2020)
Keyphrases
</>
approximation algorithms
minimum cost
spanning tree
vertex cover
np hard
np hardness
randomized algorithms
approximation schemes
special case
undirected graph
approximation ratio
minimum spanning tree
minimum weight
minimum spanning trees
np complete
decision problems