Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry ; volume:85 ; number:12 ; day:27 ; month:6 ; year:2023 ; pages:3487-3520 ; date:12.2023
Algorithmica ; 85, Heft 12 (27.6.2023), 3487-3520, 12.2023
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01143-x
- URN
-
urn:nbn:de:101:1-2024012915051083519792
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:36 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bläsius, Thomas
- Friedrich, Tobias
- Katzmann, Maximilian
- SpringerLink (Online service)
Ähnliche Objekte (12)
Hyperbolic string vertices
Hyperbolic three-string vertex
Open-closed hyperbolic string vertices
Approximating common fixed points in hyperbolic spaces
Multistring vertices and hyperbolic Kac Moody algebras
Connections between reflected entropies and hyperbolic string vertices
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
A two parameter family of lightcone-like hyperbolic string vertices
Challenges in approximating the Black and Scholes call formula with hyperbolic tangents
Graph algorithms and population protocols: Approximating Bipartite Minimum Vertex Cover in the CONGEST model
Hyperbolic geometry and closed bosonic string field theory. Part I. The string vertices via hyperbolic Riemann surfaces
Approximating Perpetuities
Hyperbolic string vertices
Hyperbolic three-string vertex
Open-closed hyperbolic string vertices
Approximating common fixed points in hyperbolic spaces
Multistring vertices and hyperbolic Kac Moody algebras
Connections between reflected entropies and hyperbolic string vertices
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
A two parameter family of lightcone-like hyperbolic string vertices
Challenges in approximating the Black and Scholes call formula with hyperbolic tangents
Graph algorithms and population protocols: Approximating Bipartite Minimum Vertex Cover in the CONGEST model
Hyperbolic geometry and closed bosonic string field theory. Part I. The string vertices via hyperbolic Riemann surfaces
Approximating Perpetuities
Hyperbolic string vertices
Hyperbolic three-string vertex
Open-closed hyperbolic string vertices
Approximating common fixed points in hyperbolic spaces
Multistring vertices and hyperbolic Kac Moody algebras
Connections between reflected entropies and hyperbolic string vertices
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
A two parameter family of lightcone-like hyperbolic string vertices
Challenges in approximating the Black and Scholes call formula with hyperbolic tangents
Graph algorithms and population protocols: Approximating Bipartite Minimum Vertex Cover in the CONGEST model
Hyperbolic geometry and closed bosonic string field theory. Part I. The string vertices via hyperbolic Riemann surfaces