scientific article; zbMATH DE number 7764116
From MaRDI portal
Publication:6089672
DOI10.4230/lipics.ipec.2020.25MaRDI QIDQ6089672
Céline M. F. Swennenhuis, Jesper Nederlof
Publication date: 13 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling partially ordered jobs faster than \(2^n\)
- Scheduling and fixed-parameter tractability
- Parameterized complexity of machine scheduling: 15 open problems
- On the parametric complexity of schedules to minimize tardy tasks.
- \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling]
- Parameterized complexity of a coupled-task scheduling problem
- Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique
- Open Problems in Throughput Scheduling
- The Design of Approximation Algorithms
- Fourier meets M\"{o}bius: fast subset convolution
- Scheduling with Outliers
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Color-coding
- A note on combined job selection and sequencing problems
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Parameterized Algorithms
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Scheduling
This page was built for publication:
