Thesis supervisor: Judit Nagy-György
Location of studies (in Hungarian): SZTE Matematika- és Számítástudományok Doktori Iskola Abbreviation of location of studies: MatDI
Description of the research topic:
In on-line optimization, an algorithm must make its decisions based only on past events without any solid information about future data. Such algorithms are called online algorithms. In this research project the plan is to use a worst-case analysis approach called competitive analysis to measure the efficiency of the algorithms. This means that we compare the objective function value of the solution produced by the on-line algorithm with the optimal offline objective function value.
The goal is the investigation of the (deterministic or randomized) online version of a combinatorial problem.
Number of students who can be accepted: 1
Deadline for application: 2017-09-01
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).