"Efficiently Approximating Vertex Cover on Scale-Free Networks with ..."

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann (2023)

> Home

Details and statistics

DOI: 10.1007/S00453-023-01143-X

access: open

type: Journal Article

metadata version: 2024-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BlasiusFK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BlasiusFK23
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. Algorithmica 85(12): 3487-3520 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.