An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays › Research Explorer

Novosibirsk State University's Research Portal

An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Links

https://link.springer.com/content/pdf/10.1007/978-3-030-49988-4.pdf
Final published version

DOI

https://doi.org/10.1007/978-3-030-49988-4_18
Final published version

Alexander Ageev
Mikhail Ivanov

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Proceedings
Editors	Alexander Kononov, Michael Khachay, Valery A. Kalyagin, Panos Pardalos
Publisher	Springer Gabler
Pages	265-273
Number of pages	9
ISBN (Print)	9783030499877
DOIs	https://doi.org/10.1007/978-3-030-49988-4_18
Publication status	Published - 1 Jan 2020
Externally published	Yes
Event	19th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2020 - Novosibirsk, Russian Federation Duration: 6 Jul 2020 → 10 Jul 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12095 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	19th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2020
Country/Territory	Russian Federation
City	Novosibirsk
Period	06.07.2020 → 10.07.2020

OECD FOS+WOS

1.01 MATHEMATICS
1.02 COMPUTER AND INFORMATION SCIENCES

Research areas

Approximation algorithm, Coupled-task scheduling, Inapproximability lower bound, Worst-case analysis

ID: 24769585