Online algorithms for packing and covering problems
2016/23/N/ST6/03412
Keywords
Descriptors
- ST6_6: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
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
Voivodeship: dolnośląskie
Principal investigator (from the host institution)
Number of co-investigators in the project: 2
Call
PRELUDIUM 12 – announced on 2016-09-15
- Amount awarded
- 32 400 PLN
- Project start date
- 2017-10-10
- Project end date
- 2018-10-09
- Project duration
- 12 months (the same as in the proposal)
- Project status
- Project settled
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)
-
Dynamic Balanced Graph Partitioning
- Authors:
- Marcin Bienkowski, Chen Avin, Andreas Loukas, Maciej Pacut, Stefan Schmid
- Status:
- Accepted for publication
-
On the Complexity of Non-Segregated Routing in Reconfigurable Data Center Architectures
- Authors:
- Klaus-Tycho Foerster, Maciej Pacut, Stefan Schmid
- Status:
- Accepted for publication