Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop

Antonios Antoniadis; Matthias Englert; Nicolaos Matsakis; Pavel Vesely

doi:10.4230/LIPIcs.ICALP.2021.17

Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop

Antonios Antoniadis, Matthias Englert , Nicolaos Matsakis, Pavel Vesely

Mathematics of Operations Research

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

4 Downloads (Pure)

Original language	English
Title of host publication	48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
ISBN (Electronic)	978-3-95977-195-5
DOIs	https://doi.org/10.4230/LIPIcs.ICALP.2021.17
Publication status	Published - 2021
Event	48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 - Online Conference Duration: 12 Jul 2021 → 16 Jul 2021 Conference number: 48

Conference

Conference	48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
Abbreviated title	ICALP 2021
City	Online Conference
Period	12/07/21 → 16/07/21

Access to Document

10.4230/LIPIcs.ICALP.2021.17Licence: CC BY

LIPIcs-ICALP-2021-17Final published version, 791 KBLicence: CC BY

Cite this

@inproceedings{39259b405ba5487aacd76302d453b99d,

title = "Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop",

author = "Antonios Antoniadis and Matthias Englert and Nicolaos Matsakis and Pavel Vesely",

year = "2021",

doi = "10.4230/LIPIcs.ICALP.2021.17",

language = "English",

booktitle = "48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)",

note = "48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, ICALP 2021 ; Conference date: 12-07-2021 Through 16-07-2021",

}

Antoniadis, A, Englert , M, Matsakis, N & Vesely, P 2021, Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop. in 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, Online Conference, 12/07/21. https://doi.org/10.4230/LIPIcs.ICALP.2021.17

TY - GEN

T1 - Breaking the Barrier Of 2 for the Competitiveness of Longest Queue Drop

AU - Antoniadis, Antonios

AU - Englert , Matthias

AU - Matsakis, Nicolaos

AU - Vesely, Pavel

N1 - Conference code: 48

PY - 2021

Y1 - 2021

U2 - 10.4230/LIPIcs.ICALP.2021.17

DO - 10.4230/LIPIcs.ICALP.2021.17

M3 - Conference contribution

BT - 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

T2 - 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021

Y2 - 12 July 2021 through 16 July 2021

ER -