Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

LP rounding approximation algorithms

2012/07/N/ST6/03068

Keywords:

approximation linear programming

Descriptors:

  • ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
  • ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
  • ST6_12: Scientific computing, simulation and modelling tools

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

Other projects carried out by the institution 

Principal investigator (from the host institution):

Bartosz Rybicki 

Number of co-investigators in the project: 2

Call: PRELUDIUM 4 - announced on 2012-09-15

Amount awarded: 149 898 PLN

Project start date (Y-m-d): 2013-07-29

Project end date (Y-m-d): 2016-07-28

Project duration:: 36 months (the same as in the proposal)

Project status: Project settled

Equipment purchased [PL]

  1. Notebook (5 000 PLN)

Information in the final report

  • Publication in academic press/journals (1)
  • Articles in post-conference publications (5)
  1. Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
    Authors:
    Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki
    Academic press:
    Theory of Computing Systems (rok: 2016, tom: 58, strony: 19-44), Wydawca: Springer
    Status:
    Published
    DOI:
    brak - link to the publication
  1. Improved Approximation Algorithm for Fault-Tolerant Facility Placement
    Authors:
    Jarosław Byrka, Bartosz Rybicki
    Conference:
    WAOA 2014 (rok: 2015, ), Wydawca: Springer
    Data:
    konferencja 9,2014
    Status:
    Published
    DOI:
    link to the publication
  2. An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
    Authors:
    Jaroslaw Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh
    Conference:
    SODA 2015 (rok: 2015, ), Wydawca: ACM Digital Library
    Data:
    konferencja 1,2015
    Status:
    Published
    DOI:
    link to the publication
  3. Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter
    Authors:
    Jarosław Byrka, Shanfei Li, Bartosz Rybicki
    Conference:
    WAOA 2013 (rok: 2013, ), Wydawca: Springer
    Data:
    konferencja 5-6.09
    Status:
    Published
    DOI:
    link to the publication
  4. An Improved Approximation Algorithm for Knapsack Median Using Sparsification
    Authors:
    Jaroslaw Byrka, Thomas Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh
    Conference:
    ESA 2015 (rok: 2015, ), Wydawca: Springer
    Data:
    konferencja 9,2015
    Status:
    Published
  5. Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
    Authors:
    Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase
    Conference:
    SODA 2015 (rok: 2015, ), Wydawca: ACD Digital Library
    Data:
    konferencja 1,2015
    Status:
    Published
    DOI:
    link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy