On the parametric complexity of schedules to minimize tardy tasks.
type: Item
instance of: scholarly article
title: On the parametric complexity of schedules to minimize tardy tasks.
zbMATH Open document ID: 1038.68049
DOI: 10.1016/S0304-3975(02)00811-3
author: Michael R. Fellows
author: Catherine McCartin
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1915465
zbMATH Keywords: parameterized complexity theory
MaRDI profile type: Publication
Wikidata QID: Q57360052
cites work: Linear extensions of random orders
cites work: On the parameterized complexity of short computation and factorization
cites work: Advice classes of parametrized tractability
cites work: A decomposition theorem for partially ordered sets
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Q4393480
cites work: Q4198056
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
DBLP publication ID: journals/tcs/FellowsM03
description: scientific article; zbMATH DE number 1915465