W[2]-hardness of precedence constrained K-processor scheduling-Reference-Cited by-同舟云学术

W[2]-hardness of precedence constrained K-processor scheduling

Published:1995-09 Issue:2 Volume:18 Page:93-97
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Bodlaender Hans L.,Fellows Michael R.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference25 articles.

1. Fixedparameter intractability II;Abrahamson,1993

2. K. Abrahamson, R. Downey and M. Fellows, “Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs”, to appear in Ann. Pure Appl. Logic.

3. Finite automata, bounded treewidth and well-quasiordering;Abrahamson,1993

4. A tourist guide through treewidth;Bodlaender,1992

5. H. Bodlaender, R. Downey, M. Fellows, M. Hallett and H. Wareham, “Parameterized complexity analysis in computational biology”, to appear in Comput. Appl. Biosci.

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized problems complete for nondeterministic FPT time and logarithmic space;Information and Computation;2024-10

2. A New Structural Parameter on Single Machine Scheduling with Release Dates and Deadlines;Lecture Notes in Computer Science;2024

3. Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines;Journal of Scheduling;2023-07-17

4. A NOTE ON HARDNESS OF MULTIPROCESSOR SCHEDULING WITH SCHEDULING SOLUTION SPACE TREE;Computer Science;2023-03-06

5. Polynomial-time data reduction for weighted problems beyond additive goal functions;Discrete Applied Mathematics;2023-03