An introduction to multi-parameter complexity analysis of discrete problems
type: Item
instance of: scholarly article
title: An introduction to multi-parameter complexity analysis of discrete problems
zbMATH Open document ID: 1066.90039
published in: European Journal of Operational Research
publication date: 2005-04-21T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 2160294
zbMATH Keywords: Complexity theory
zbMATH Keywords: Combinatorial optimization
zbMATH Keywords: Parameterized family of subproblems
zbMATH Keywords: Scheduling
zbMATH Keywords: Coloring
author: Sergey Sevastyanov
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.04.009
OpenAlex ID: W1964857877
cites work: The complexity of two group scheduling problems
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Four-parametric complexity analysis for an open shop problem
cites work: Q4527276
cites work: Q4936660
DOI: 10.1016/J.EJOR.2004.04.009
description: scientific article; zbMATH DE number 2160294