Zmiana języka

Projects search

Algorithms for connectivity under uncertainty

2020/39/B/ST6/01641

Keywords

Descriptors

  • ST6_006: 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

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr hab. Jarosław Byrka

Number of co-investigators in the project: 5

Call

OPUS 20 – announced on 2020-09-15

Amount awarded
1 509 600 PLN
Project start date
2021-07-23
Project end date
2027-07-22
Project duration
72 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

Articles in post-conference publications (8)

  1. How Does Fairness Affect the Complexity of Gerrymandering

    Authors:
    Sandip Banerjee, Rajesh Chitnis, Abhiruk Lahiri
    Conference:
    AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems (year: 2023, volume: AAMAS '23: The 2023 International Conference on Autonomous Agents and Multiagent Systems, pages: 2869–2871), Publisher: International Foundation for Autonomous Agents and Multiagent Systems
    Date:
    conference 29.05-02.06.2023
    Status:
    Published
    DOI:
    10.5555/3545946.3599106 – link to the publication

  2. Fine-Grained Liquid Democracy for Cumulative Ballots

    Authors:
    Matthias Köppe, Martin Koutecký, Krzysztof Sornat, Nimrod Talmon
    Conference:
    Proc. of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2024) (year: 2024, volume: 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2024), pages: 1029--1037), Publisher: International Foundation for Autonomous Agents and Multiagent Systems
    Date:
    conference May 6–10, 2024
    Status:
    Published
    DOI:
    link to the publication

  3. Parameterized Approximation Schemes for Clustering with General Norm Objectives

    Authors:
    Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase.
    Conference:
    2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (year: 2023, volume: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages: 1377--1399), Publisher: IEEE
    Date:
    conference 6-9.11.2023
    Status:
    Published
    DOI:
    10.1109/FOCS57990.2023.00085 – link to the publication

  4. Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces

    Authors:
    Fateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
    Conference:
    51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) (year: 2024, volume: International Colloquium on Automata, Languages, and Programming (ICALP), pages: 6:1-6:19), Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    Date:
    conference July 8-12, 2024
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ICALP.2024.6 – link to the publication

  5. The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller Than 2

    Authors:
    Jarosław Byrka, Fabrizio Grandoni, Vera Traub
    Conference:
    2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) (year: 2024, volume: 65th Annual Symposium on Foundations of Computer Science (FOCS), pages: 730-753), Publisher: IEEE
    Date:
    conference 27-30 October 2024
    Status:
    Published
    DOI:
    10.48550/arXiv.2407.19905 – link to the publication

  6. 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: International Colloquium on Automata, Languages, and Programming (ICALP), pages: 5:1-5:20), Publisher: Schloss Dagstuhl - Leibniz Center for Informatics
    Date:
    conference 8-12.07.2024
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ICALP.2024.5 – link to the publication

  7. Online Facility Location with Linear Delay

    Authors:
    Marcin Bieńkowsk, Martin Böhm, Jarosław Byrka, Jan Marcinkowski
    Conference:
    Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). (year: 2022, volume: APPROX 2022, pages: 5:1–45:17), Publisher: Leibnitz International Proceedings in Informatics
    Date:
    conference 19-21,09, 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.APPROX/RANDOM.2022.45 – link to the publication

  8. Sublogarithmic Approximation for Tollbooth Pricing on a Cactus

    Authors:
    Andrzej Turko, Jarosław Byrka
    Conference:
    Algorithmic Game Theory. SAGT 2024 (year: 2024, volume: International Symposium on Algorithmic Game Theory, pages: 297--314), Publisher: Springer Nature Switzerland
    Date:
    conference September 3–6, 2024
    Status:
    Published
    DOI:
    10.48550/arXiv.2305.05405 – link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski