Hochschulschrift
Randomized approximation for the matching and vertex cover problem in hypergraphs : complexity and algorithms
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
XIX, 119 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Kiel, Univ., Diss., 2013
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:14 MEZ
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.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Complexity and approximation, Buch.
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Distributed CONGEST approximation of weighted vertex covers and matchings
Randomized algorithms : approximation, generation and counting
Conductivity of disordered electrons: mean-field approximation containing vertex corrections
Complexity theoretical results for randomized branching programs
Vertex
On the computational complexity of projective image matching
Complexity and algorithms in matching problems under preferences
On scheduling cycle shops : classification, complexity and approximation
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Complexity and approximation, Buch.
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Distributed CONGEST approximation of weighted vertex covers and matchings
Randomized algorithms : approximation, generation and counting
Conductivity of disordered electrons: mean-field approximation containing vertex corrections
Complexity theoretical results for randomized branching programs
Vertex
On the computational complexity of projective image matching
Complexity and algorithms in matching problems under preferences
On scheduling cycle shops : classification, complexity and approximation
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Complexity and approximation, Buch.
Approximation complexity of optimization problems
Approximation complexity of optimization problems
Distributed CONGEST approximation of weighted vertex covers and matchings
Randomized algorithms : approximation, generation and counting
Conductivity of disordered electrons: mean-field approximation containing vertex corrections
Complexity theoretical results for randomized branching programs
Vertex
On the computational complexity of projective image matching
Complexity and algorithms in matching problems under preferences