Scheduling and Fixed-Parameter Tractability

DOI10.1007/978-3-319-07557-0_32zbMath1332.68088arXiv1311.4021OpenAlexW2174437812MaRDI QIDQ5419011

Andreas Wiese, Matthias Mnich

Publication date: 2 June 2014

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.4021

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Interval scheduling and colorful independent sets ⋮ Scheduling and fixed-parameter tractability

This page was built for publication: Scheduling and Fixed-Parameter Tractability