Login / Signup
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
Published in:
CoRR (2020)
Keyphrases
</>
vertex cover
scale free networks
approximation algorithms
complex networks
partial order
planar graphs
scale free
multi agent
scheduling problem
optimality criterion
power law distribution