Sciact
  • EN
  • RU

Approximating Coupled-Task Scheduling Problems with Equal Exact Delays Full article

Journal Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349
Output data Year: 2016, Pages: 259-271 Pages count : 13 DOI: 10.1007/978-3-319-44914-2_21
Tags Approximation algorithm; Couple-task scheduling; Inapproximability lower bound; Worst-case analysis
Authors Ageev Alexander 1 , Ivanov Mikhail 2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
Cite: Ageev A. , Ivanov M.
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays
Lecture Notes in Computer Science. 2016. P.259-271. DOI: 10.1007/978-3-319-44914-2_21 WOS Scopus OpenAlex
Identifiers:
Web of science: WOS:000387730300021
Scopus: 2-s2.0-84987959321
OpenAlex: W2557915111
Citing:
DB Citing
Scopus 7
OpenAlex 8
Altmetrics: