Projects funded by the NCN
Online algorithms for packing and covering problems
2016/23/N/ST6/03412
Keywords:
online algorithms packing covering competitive ratio clustering
Descriptors:
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
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. 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 (Y-m-d): 2017-10-10
Project end date (Y-m-d): 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)
- Book publications / chapters in book publications (1)
- Dynamic Balanced Graph PartitioningAuthors:Marcin Bienkowski, Chen Avin, Andreas Loukas, Maciej Pacut, Stefan SchmidAcademic press:SIAM Journal on Discrete Mathematics (rok: 2019, ), Wydawca: Society for Industrial and Applied MathematicsStatus:Accepted for publicationDOI:brak - link to the publication
- On the Complexity of Non-Segregated Routing in Reconfigurable Data Center ArchitecturesAuthors:Klaus-Tycho Foerster, Maciej Pacut, Stefan SchmidAcademic press:ACM SIGCOMM Computer Communication Review (rok: 2019, ), Wydawca: ACMStatus:Accepted for publicationDOI:brak - link to the publication
- Praca doktorskaAuthors:Maciej PacutBook:Algorithmic aspects of contemporary networks (rok: 2019, ), Wydawca: Uniwersytet WrocławskiStatus:Submitted