Combinatorial optimization under uncertainty: matroids,matchings and submodular functions
2019/35/D/ST6/03060
Descriptors
- ST6_006: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
- ST6_004: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna, algorytmy kwantowe
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: 3
Call
SONATA 15 – announced on 2019-09-16
- Amount awarded
- 778 800 PLN
- Project start date
- 2020-10-01
- Project end date
- 2025-09-30
- Project duration
- 60 months (the same as in the proposal)
- Project status
- Project completed
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
Articles in post-conference publications (1)
-
An O(loglog n)-Approximation for Submodular Facility Location
- Authors:
- Fateme Abbasi , Marek Adamczyk , Miguel Bosch-Calvo , Jarosław Byrka , Fabrizio Grandoni , Krzysztof Sornat , Antoine Tinguely
- Conference:
- 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) (year: 2024, volume: 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), pages: 5:1-5:20), Publisher: International Colloquium on Automata, Languages, and Programming (ICALP)
- Date:
- conference 45475
- Status:
- Published
- DOI:
- 10.4230/LIPIcs.ICALP.2024.5 – link to the publication