Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
Crossref DOI link: https://doi.org/10.1007/s00453-023-01143-x
Published Online: 2023-06-27
Published Print: 2023-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bläsius, Thomas
Friedrich, Tobias
Katzmann, Maximilian http://orcid.org/0000-0002-9302-5527
Funding for this research was provided by:
Karlsruher Institut für Technologie (KIT)
Text and Data Mining valid from 2023-06-27
Version of Record valid from 2023-06-27
Article History
Received: 21 April 2022
Accepted: 9 June 2023
First Online: 27 June 2023