- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Technische Universität Berlin, Dissertation, 2022
- Schlagwort
-
Mustervergleich
Matching
Berechnungskomplexität
NP-hartes Problem
Matching-Problem
Effizienter Algorithmus
Graph
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Technische Universität Berlin
- (wann)
-
2023
- Urheber
- Beteiligte Personen und Organisationen
-
Niedermeier, Rolf
Brill, Markus
Manlove, David
Saurabh, Saket
- DOI
-
10.14279/depositonce-16756
- Handle
-
11303/17965
- URN
-
urn:nbn:de:101:1-2023011801025834436353
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:53 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.
Beteiligte
- Heeger, Klaus
- Niedermeier, Rolf
- Brill, Markus
- Manlove, David
- Saurabh, Saket
- Technische Universität Berlin
Entstanden
- 2023
Ähnliche Objekte (12)
A refined complexity analysis of fair districting over graphs
A refined complexity analysis of fair districting over graphs
On the Complexity of Modified Instances
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Classic graph problems made temporal – a parameterized complexity analysis
Fine-grained complexity analysis of some combinatorial data science problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
New parameterized algorithms for matching and packing problems
The power of linear-time data reduction for maximum matching
Majority Relations and Tournament Solutions : A Computational Study
A refined complexity analysis of fair districting over graphs
A refined complexity analysis of fair districting over graphs
On the Complexity of Modified Instances
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Classic graph problems made temporal – a parameterized complexity analysis
Fine-grained complexity analysis of some combinatorial data science problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
New parameterized algorithms for matching and packing problems
The power of linear-time data reduction for maximum matching
Majority Relations and Tournament Solutions : A Computational Study
A refined complexity analysis of fair districting over graphs
A refined complexity analysis of fair districting over graphs
On the Complexity of Modified Instances
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Classic graph problems made temporal – a parameterized complexity analysis
Fine-grained complexity analysis of some combinatorial data science problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
New parameterized algorithms for matching and packing problems
The power of linear-time data reduction for maximum matching