Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Leveraging Randomization: From Scheduling to AdWords

2020/39/B/ST6/01679

Keywords:

online algorithms competitive analysis job scheduling randomized algorithms assignment problems

Descriptors:

  • ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
  • ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
  • ST1_14: Discrete mathematics and combinatorics

Panel:

ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution :

Uniwersytet Wrocławski, Wydział Matematyki i Informatyki

woj.

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Łukasz Jeż 

Number of co-investigators in the project: 3

Call: OPUS 20 - announced on 2020-09-15

Amount awarded: 1 044 000 PLN

Project start date (Y-m-d): 2021-07-23

Project end date (Y-m-d): 2025-07-22

Project duration:: 48 months (the same as in the proposal)

Project status: Pending project

Project description

Download the project description in a pdf file

Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

  • Publication in academic press/journals (2)
  • Articles in post-conference publications (2)
  1. A phi-Competitive Algorithm for Scheduling Packets with Deadlines
    Authors:
    Pavel Veselý, Marek Chrobak, Łukasz Jeż, Jirí Sgall
    Academic press:
    SIAM Journal on Computing (rok: 2022, tom: 51 (5), strony: 1626-1691), Wydawca: Society for Industrial and Applied Mathematics (SIAM)
    Status:
    Published
    DOI:
    10.1137/21M1469753 - link to the publication
  2. A phi-Competitive Algorithm for Scheduling Packets with Deadlines
    Authors:
    Pavel Veselý, Marek Chrobak, Łukasz Jeż, Jirí Sgall
    Academic press:
    SIAM Journal on Computing (rok: 2022, tom: 51 (5), strony: 1626-1691), Wydawca: Society for Industrial and Applied Mathematics (SIAM)
    Status:
    Published
    DOI:
    10.1137/21M1469753 - link to the publication
  1. Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems
    Authors:
    János Balogh, György Dósa, Leah Epstein, Lukasz Jez
    Conference:
    Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings. Lecture Notes in Computer Science 13270, Springer 2022, ISBN 978-3-031-06677-1 (rok: 2022, tom: 33rd International Workshop on Combinatorial Algorithms (IWOCA), strony: 101-113), Wydawca: Springer Nature
    Data:
    konferencja 07-09.06.2022
    Status:
    Published
    DOI:
    10.1007/978-3-031-06678-8_8 - link to the publication
  2. Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems
    Authors:
    János Balogh, György Dósa, Leah Epstein, Lukasz Jez
    Conference:
    Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings. Lecture Notes in Computer Science 13270, Springer 2022, ISBN 978-3-031-06677-1 (rok: 2022, tom: 33rd International Workshop on Combinatorial Algorithms (IWOCA), strony: 101-113), Wydawca: Springer Nature
    Data:
    konferencja 07-09.06.2022
    Status:
    Published
    DOI:
    10.1007/978-3-031-06678-8_8 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy