- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-0490
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Multistage Vertex Cover ; volume:66 ; number:2 ; day:29 ; month:4 ; year:2022 ; pages:454-483 ; date:4.2022
Theory of computing systems ; 66, Heft 2 (29.4.2022), 454-483, 4.2022
- Urheber
-
Fluschnik, Till
Niedermeier, Rolf
Rohm, Valentin
Zschoche, Philipp
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00224-022-10069-w
- URN
-
urn:nbn:de:101:1-2022121010090970854501
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 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
- Fluschnik, Till
- Niedermeier, Rolf
- Rohm, Valentin
- Zschoche, Philipp
- SpringerLink (Online service)
Ähnliche Objekte (12)
Multistage vertex cover
Computing subset vertex covers in H-free graphs
Distributed CONGEST approximation of weighted vertex covers and matchings
Sequential Monte Carlo for Counting Vertex Covers in General Graphs
On algorithmic approaches for independent sets, vertex covers, and colourings
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Vertex
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
From spin vertex to string vertex
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
Multistage Optimization
Generalized vertex algebras and relative vertex operators
Multistage vertex cover
Computing subset vertex covers in H-free graphs
Distributed CONGEST approximation of weighted vertex covers and matchings
Sequential Monte Carlo for Counting Vertex Covers in General Graphs
On algorithmic approaches for independent sets, vertex covers, and colourings
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Vertex
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
From spin vertex to string vertex
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
Multistage Optimization
Generalized vertex algebras and relative vertex operators
Multistage vertex cover
Computing subset vertex covers in H-free graphs
Distributed CONGEST approximation of weighted vertex covers and matchings
Sequential Monte Carlo for Counting Vertex Covers in General Graphs
On algorithmic approaches for independent sets, vertex covers, and colourings
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Vertex
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
From spin vertex to string vertex
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry
Multistage Optimization