An introduction to multi-parameter complexity analysis of discrete problems

European Journal of Operational Research

Volumn 165, Issue 2, 2005, Pages 387-397

  Sevastianov, S V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

Coloring; Combinatorial optimization; Complexity theory; Parameterized family of subproblems; Scheduling

Indexed keywords

COLORING; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DISCRETE TIME CONTROL SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

COMBINATORIAL OPTIMIZATION; COMPLEXITY THEORY; PARAMETERIZED FAMILY OF SUBPROBLEMS; SUBPROBLEMS;

OPERATIONS RESEARCH;

EID: 13444309302     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.04.009     Document Type: Conference Paper

References (7)

1. Blazewicz J., Kovalyov M. The complexity of two group scheduling problems. Journal of Scheduling. 5:2002;477-485
2. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco
3. Gonzalez T., Sahni S. Open shop scheduling to minimize finish time. Journal of the Association of Computer Machinery. 23:1976;665-679
4. Kashyrskikh K.N., Sevastianov S.V., Tchernykh I.D. 4-parameter complexity analysis of the open shop problem. Diskretnyi Analiz i Issledovanie Operacii, Ser. 1. 7(4):2000;59-77. (in Russian)
5. Kononov A., Sevastianov S. On the complexity of the connected list vertex-coloring problem. Diskretnyi Analiz i Issledovanie Operacii, Ser. 1. 7(2):2000;21-46. (in Russian)
6. Shafransky Y.M. On a revision of some notions of the theory of computational complexity. 1997;Academy of sciences of Belarus, Institute of engineering cybernetics, Minsk. Preprint no.1
7. Vising V.G. On the connected list coloring of graphs. Diskretnyi Analiz i Issledovanie Operacii, Ser. 1. 6(4):1999;36-43. (in Russian)