A multivariate complexity analysis of the material consumption scheduling problem

to connected objects

Language: Englisch

Identifier: 1310698260

Contributor

Bentert, Matthias
Bredereck, Robert
Györgyi, Péter
Kaczmarczyk, Andrzej
Niedermeier, Rolf

DOI: 10.14279/depositonce-19455

URN: http://nbn-resolving.org/urn:nbn:de:101:1-2023112201002571810755

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 09.01.2024, 9:53 AM CET

Data provider

Deutsche Nationalbibliothek

Show original at data provider

Associated

Bentert, Matthias
Bredereck, Robert
Györgyi, Péter
Kaczmarczyk, Andrzej
Niedermeier, Rolf

Other Objects (12)

Monografie

Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments

Monografie

Multivariate complexity analyses for algorithmic challenges in fairness and sustainability

Monografie

Multivariate complexity analysis of team management problems

A refined complexity analysis of fair districting over graphs

Monografie

Classic graph problems made temporal – a parameterized complexity analysis

Assessing the computational complexity of multilayer subgraph detection

Monografie

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

Monografie

Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments

Monografie

Multivariate complexity analyses for algorithmic challenges in fairness and sustainability

Monografie

Multivariate complexity analysis of team management problems

A refined complexity analysis of fair districting over graphs

Monografie

Classic graph problems made temporal – a parameterized complexity analysis

Assessing the computational complexity of multilayer subgraph detection

Monografie

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

Monografie

Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments

Monografie

Multivariate complexity analyses for algorithmic challenges in fairness and sustainability

Monografie

Multivariate complexity analysis of team management problems

A refined complexity analysis of fair districting over graphs

Monografie

Classic graph problems made temporal – a parameterized complexity analysis

Assessing the computational complexity of multilayer subgraph detection

Monografie

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

Create user account

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

* I have read the terms of use and the privacy policy for the collection of personal data and accept them.

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

A multivariate complexity analysis of the material consumption scheduling problem

Object Details

Contributors, Location and Time

Further information

Data provider

Associated

Other Objects (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

Multistage vertex cover

Related objects