A multivariate complexity analysis of the material consumption scheduling problem
- Sprache
-
Englisch
- Identifier
-
1310698260
Beteiligte Personen und Organisationen
Bentert, Matthias
Bredereck, Robert
Györgyi, Péter
Kaczmarczyk, Andrzej
Niedermeier, Rolf
Bredereck, Robert
Györgyi, Péter
Kaczmarczyk, Andrzej
Niedermeier, Rolf
- DOI
-
10.14279/depositonce-19455
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
09.01.2024, 09:53 MEZ
Beteiligte
- Bentert, Matthias
- Bredereck, Robert
- Györgyi, Péter
- Kaczmarczyk, Andrzej
- Niedermeier, Rolf
Ähnliche Objekte (12)
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Multivariate complexity analyses for algorithmic challenges in fairness and sustainability
Multivariate complexity analysis of team management problems
A refined complexity analysis of fair districting over graphs
Classic graph problems made temporal – a parameterized complexity analysis
Assessing the computational complexity of multilayer subgraph detection
Elements of dynamic and 2-SAT programming: paths, trees, and cuts
Preface of STACS 2019 Special Issue
The power of linear-time data reduction for maximum matching
Co-Clustering under the Maximum Norm
Multistage s–t Path: Confronting Similarity with Dissimilarity
Multistage vertex cover
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Multivariate complexity analyses for algorithmic challenges in fairness and sustainability
Multivariate complexity analysis of team management problems
A refined complexity analysis of fair districting over graphs
Classic graph problems made temporal – a parameterized complexity analysis
Assessing the computational complexity of multilayer subgraph detection
Elements of dynamic and 2-SAT programming: paths, trees, and cuts
Preface of STACS 2019 Special Issue
The power of linear-time data reduction for maximum matching
Co-Clustering under the Maximum Norm
Multistage s–t Path: Confronting Similarity with Dissimilarity
Multistage vertex cover
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Multivariate complexity analyses for algorithmic challenges in fairness and sustainability
Multivariate complexity analysis of team management problems
A refined complexity analysis of fair districting over graphs
Classic graph problems made temporal – a parameterized complexity analysis
Assessing the computational complexity of multilayer subgraph detection
Elements of dynamic and 2-SAT programming: paths, trees, and cuts
Preface of STACS 2019 Special Issue
The power of linear-time data reduction for maximum matching
Co-Clustering under the Maximum Norm
Multistage s–t Path: Confronting Similarity with Dissimilarity