Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Jarosław Byrka"
download as .bib file
@article{DBLP:journals/siamcomp/ByrkaGA23,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Afrouz Jabal Ameli},
title = {Breaching the 2-Approximation Barrier for Connectivity Augmentation:
{A} Reduction to Steiner Tree},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {3},
pages = {718--739},
year = {2023},
url = {https://doi.org/10.1137/21m1421143},
doi = {10.1137/21M1421143},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ByrkaGA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbbasiBBCGKMSS23,
author = {Fateme Abbasi and
Sandip Banerjee and
Jaroslaw Byrka and
Parinya Chalermsook and
Ameet Gadekar and
Kamyar Khodamoradi and
D{\'{a}}niel Marx and
Roohani Sharma and
Joachim Spoerhase},
title = {Parameterized Approximation Schemes for Clustering with General Norm
Objectives},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1377--1399},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00085},
doi = {10.1109/FOCS57990.2023.00085},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbbasiBBCGKMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2023,
editor = {Jaroslaw Byrka and
Andreas Wiese},
title = {Approximation and Online Algorithms - 21st International Workshop,
{WAOA} 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14297},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-49815-2},
doi = {10.1007/978-3-031-49815-2},
isbn = {978-3-031-49814-5},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-03146,
author = {Fateme Abbasi and
Sandip Banerjee and
Jaroslaw Byrka and
Parinya Chalermsook and
Ameet Gadekar and
Kamyar Khodamoradi and
D{\'{a}}niel Marx and
Roohani Sharma and
Joachim Spoerhase},
title = {Parameterized Approximation Schemes for Clustering with General Norm
Objectives},
journal = {CoRR},
volume = {abs/2304.03146},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.03146},
doi = {10.48550/ARXIV.2304.03146},
eprinttype = {arXiv},
eprint = {2304.03146},
timestamp = {Tue, 18 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-03146.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-05405,
author = {Andrzej Turko and
Jaroslaw Byrka},
title = {Sublogarithmic Approximation for Tollbooth Pricing on a Cactus},
journal = {CoRR},
volume = {abs/2305.05405},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.05405},
doi = {10.48550/ARXIV.2305.05405},
eprinttype = {arXiv},
eprint = {2305.05405},
timestamp = {Mon, 15 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-05405.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-07316,
author = {Fateme Abbasi and
Sandip Banerjee and
Jaroslaw Byrka and
Parinya Chalermsook and
Ameet Gadekar and
Kamyar Khodamoradi and
D{\'{a}}niel Marx and
Roohani Sharma and
Joachim Spoerhase},
title = {Parameterized Approximation for Robust Clustering in Discrete Geometric
Spaces},
journal = {CoRR},
volume = {abs/2305.07316},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.07316},
doi = {10.48550/ARXIV.2305.07316},
eprinttype = {arXiv},
eprint = {2305.07316},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-07316.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-10935,
author = {Martin B{\"{o}}hm and
Jaroslaw Byrka and
Mateusz Lewandowski and
Jan Marcinkowski},
title = {Submodularity Gaps for Selected Network Design and Matching Problems},
journal = {CoRR},
volume = {abs/2305.10935},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.10935},
doi = {10.48550/ARXIV.2305.10935},
eprinttype = {arXiv},
eprint = {2305.10935},
timestamp = {Thu, 25 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-10935.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BienkowskiBBM22,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Jan Marcinkowski},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Online Facility Location with Linear Delay},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {45:1--45:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.45},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.45},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BienkowskiBBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-05474,
author = {Fateme Abbasi and
Marek Adamczyk and
Miguel Bosch{-}Calvo and
Jaroslaw Byrka and
Fabrizio Grandoni and
Krzysztof Sornat and
Antoine Tinguely},
title = {An O(loglog n)-Approximation for Submodular Facility Location},
journal = {CoRR},
volume = {abs/2211.05474},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.05474},
doi = {10.48550/ARXIV.2211.05474},
eprinttype = {arXiv},
eprint = {2211.05474},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-05474.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiBBCDF21,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {New results on multi-level aggregation},
journal = {Theor. Comput. Sci.},
volume = {861},
pages = {133--143},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.02.016},
doi = {10.1016/J.TCS.2021.02.016},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiBBCDF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-15155,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Jan Marcinkowski},
title = {Online Facility Location with Linear Delay},
journal = {CoRR},
volume = {abs/2110.15155},
year = {2021},
url = {https://arxiv.org/abs/2110.15155},
eprinttype = {arXiv},
eprint = {2110.15155},
timestamp = {Tue, 02 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-15155.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BienkowskiBBCDF20,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {Online Algorithms for Multilevel Aggregation},
journal = {Oper. Res.},
volume = {68},
number = {1},
pages = {214--232},
year = {2020},
url = {https://doi.org/10.1287/opre.2019.1847},
doi = {10.1287/OPRE.2019.1847},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ior/BienkowskiBBCDF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ByrkaLS20,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Joachim Spoerhase},
title = {Approximating Node-Weighted k-MST on Planar Graphs},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {626--644},
year = {2020},
url = {https://doi.org/10.1007/s00224-020-09965-w},
doi = {10.1007/S00224-020-09965-W},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ByrkaLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ByrkaLMSU20,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Syed Mohammad Meesum and
Joachim Spoerhase and
Sumedha Uniyal},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {{PTAS} for Steiner Tree on Map Graphs},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {3--14},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_1},
doi = {10.1007/978-3-030-61792-9\_1},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/ByrkaLMSU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BienkowskiBCJ20,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Christian Coester and
Lukasz Jez},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Unbounded lower bound for k-server against weak adversaries},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1165--1169},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384306},
doi = {10.1145/3357713.3384306},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BienkowskiBCJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Byrka0A20,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Afrouz Jabal Ameli},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Breaching the 2-approximation barrier for connectivity augmentation:
a reduction to Steiner tree},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {815--825},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384301},
doi = {10.1145/3357713.3384301},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Byrka0A20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ByrkaDMMW20,
author = {Jaroslaw Byrka and
Szymon Dudycz and
Pasin Manurangsi and
Jan Marcinkowski and
Michal Wlodarczyk},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {To Close Is Easier Than To Open: Dual Parameterization To k-Median},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {113--126},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_8},
doi = {10.1007/978-3-030-80879-2\_8},
timestamp = {Tue, 20 Jul 2021 15:29:23 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ByrkaDMMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ByrkaL20,
author = {Jaroslaw Byrka and
Mateusz Lewandowski},
editor = {Christos Kaklamanis and
Asaf Levin},
title = {Concave Connection Cost Facility Location and the Star Inventory Routing
Problem},
booktitle = {Approximation and Online Algorithms - 18th International Workshop,
{WAOA} 2020, Virtual Event, September 9-10, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12806},
pages = {174--188},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-80879-2\_12},
doi = {10.1007/978-3-030-80879-2\_12},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ByrkaL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2020,
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-164-1},
isbn = {978-3-95977-164-1},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-08083,
author = {Jaroslaw Byrka and
Szymon Dudycz and
Pasin Manurangsi and
Jan Marcinkowski and
Michal Wlodarczyk},
title = {To Close Is Easier Than To Open: Dual Parameterization To k-Median},
journal = {CoRR},
volume = {abs/2011.08083},
year = {2020},
url = {https://arxiv.org/abs/2011.08083},
eprinttype = {arXiv},
eprint = {2011.08083},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-08083.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BienkowskiBM19,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marcin Mucha},
title = {Dynamic Beats Fixed: On Phase-based Algorithms for File Migration},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {4},
pages = {46:1--46:21},
year = {2019},
url = {https://doi.org/10.1145/3340296},
doi = {10.1145/3340296},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BienkowskiBM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AdamczykBMM019,
author = {Marek Adamczyk and
Jaroslaw Byrka and
Jan Marcinkowski and
Syed Mohammad Meesum and
Michal Wlodarczyk},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Constant-Factor {FPT} Approximation for Capacitated k-Median},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {1:1--1:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.1},
doi = {10.4230/LIPICS.ESA.2019.1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AdamczykBMM019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BienkowskiBCCJK19,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Christian Coester and
Lukasz Jez and
Elias Koutsoupias},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Better Bounds for Online Line Chasing},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.8},
doi = {10.4230/LIPICS.MFCS.2019.8},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BienkowskiBCCJK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01592,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Christian Coester and
Lukasz Jez},
title = {Unbounded lower bound for k-server against weak adversaries},
journal = {CoRR},
volume = {abs/1911.01592},
year = {2019},
url = {http://arxiv.org/abs/1911.01592},
eprinttype = {arXiv},
eprint = {1911.01592},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-02259,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Afrouz Jabal Ameli},
title = {Breaching the 2-Approximation Barrier for Connectivity Augmentation:
a Reduction to Steiner Tree},
journal = {CoRR},
volume = {abs/1911.02259},
year = {2019},
url = {http://arxiv.org/abs/1911.02259},
eprinttype = {arXiv},
eprint = {1911.02259},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-02259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-00717,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Syed Mohammad Meesum and
Joachim Spoerhase and
Sumedha Uniyal},
title = {{PTAS} for Steiner Tree on Map Graphs},
journal = {CoRR},
volume = {abs/1912.00717},
year = {2019},
url = {http://arxiv.org/abs/1912.00717},
eprinttype = {arXiv},
eprint = {1912.00717},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-00717.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-00770,
author = {Jaroslaw Byrka and
Mateusz Lewandowski},
title = {Concave connection cost Facility Location and the Star Inventory Routing
problem},
journal = {CoRR},
volume = {abs/1912.00770},
year = {2019},
url = {http://arxiv.org/abs/1912.00770},
eprinttype = {arXiv},
eprint = {1912.00770},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-00770.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ByrkaPRSST18,
author = {Jaroslaw Byrka and
Thomas W. Pensyl and
Bartosz Rybicki and
Joachim Spoerhase and
Aravind Srinivasan and
Khoa Trinh},
title = {An Improved Approximation Algorithm for Knapsack Median Using Sparsification},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1093--1114},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0294-4},
doi = {10.1007/S00453-017-0294-4},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ByrkaPRSST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ByrkaS18,
author = {Jaroslaw Byrka and
Aravind Srinivasan},
title = {Approximation Algorithms for Stochastic and Risk-Averse Optimization},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {1},
pages = {44--63},
year = {2018},
url = {https://doi.org/10.1137/15M1043790},
doi = {10.1137/15M1043790},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ByrkaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ByrkaSS18,
author = {Jaroslaw Byrka and
Piotr Skowron and
Krzysztof Sornat},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Proportional Approval Voting, Harmonic k-median, and Negative Association},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {26:1--26:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.26},
doi = {10.4230/LIPICS.ICALP.2018.26},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ByrkaSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ByrkaSS18,
author = {Jaroslaw Byrka and
Krzysztof Sornat and
Joachim Spoerhase},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Constant-factor approximation for ordered k-median},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {620--631},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188930},
doi = {10.1145/3188745.3188930},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ByrkaSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ByrkaLS18,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Joachim Spoerhase},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Approximating Node-Weighted k-MST on Planar Graphs},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {87--101},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_6},
doi = {10.1007/978-3-030-04693-4\_6},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ByrkaLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-00313,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Joachim Spoerhase},
title = {Approximating Node-Weighted k-MST on Planar Graphs},
journal = {CoRR},
volume = {abs/1801.00313},
year = {2018},
url = {http://arxiv.org/abs/1801.00313},
eprinttype = {arXiv},
eprint = {1801.00313},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-00313.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-05791,
author = {Marek Adamczyk and
Jaroslaw Byrka and
Jan Marcinkowski and
Syed Mohammad Meesum and
Michal Wlodarczyk},
title = {Constant factor {FPT} approximation for capacitated k-median},
journal = {CoRR},
volume = {abs/1809.05791},
year = {2018},
url = {http://arxiv.org/abs/1809.05791},
eprinttype = {arXiv},
eprint = {1809.05791},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-05791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-09233,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Christian Coester and
Lukasz Jez and
Elias Koutsoupias},
title = {Better Bounds for Online Line Chasing},
journal = {CoRR},
volume = {abs/1811.09233},
year = {2018},
url = {http://arxiv.org/abs/1811.09233},
eprinttype = {arXiv},
eprint = {1811.09233},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-09233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ByrkaPRST17,
author = {Jaroslaw Byrka and
Thomas W. Pensyl and
Bartosz Rybicki and
Aravind Srinivasan and
Khoa Trinh},
title = {An Improved Approximation for \emph{k}-Median and Positive Correlation
in Budgeted Optimization},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {2},
pages = {23:1--23:31},
year = {2017},
url = {https://doi.org/10.1145/2981561},
doi = {10.1145/2981561},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ByrkaPRST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BienkowskiBM17,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marcin Mucha},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {13:1--13:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.13},
doi = {10.4230/LIPICS.ICALP.2017.13},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BienkowskiBM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaSS17,
author = {Jaroslaw Byrka and
Piotr Skowron and
Krzysztof Sornat},
title = {Proportional Approval Voting, Harmonic k-median, and Negative Association},
journal = {CoRR},
volume = {abs/1704.02183},
year = {2017},
url = {http://arxiv.org/abs/1704.02183},
eprinttype = {arXiv},
eprint = {1704.02183},
timestamp = {Fri, 09 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-01972,
author = {Jaroslaw Byrka and
Krzysztof Sornat and
Joachim Spoerhase},
title = {Constant-Factor Approximation for Ordered k-Median},
journal = {CoRR},
volume = {abs/1711.01972},
year = {2017},
url = {http://arxiv.org/abs/1711.01972},
eprinttype = {arXiv},
eprint = {1711.01972},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-01972.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-06996,
author = {Jaroslaw Byrka and
Aravind Srinivasan},
title = {Approximation algorithms for stochastic and risk-averse optimization},
journal = {CoRR},
volume = {abs/1712.06996},
year = {2017},
url = {http://arxiv.org/abs/1712.06996},
eprinttype = {arXiv},
eprint = {1712.06996},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-06996.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ByrkaLR16,
author = {Jaroslaw Byrka and
Shanfei Li and
Bartosz Rybicki},
title = {Improved Approximation Algorithm for k-level Uncapacitated Facility
Location Problem (with Penalties)},
journal = {Theory Comput. Syst.},
volume = {58},
number = {1},
pages = {19--44},
year = {2016},
url = {https://doi.org/10.1007/s00224-014-9575-3},
doi = {10.1007/S00224-014-9575-3},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ByrkaLR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BienkowskiBBCDF16,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jiri Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Online Algorithms for Multi-Level Aggregation},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {12:1--12:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.12},
doi = {10.4230/LIPICS.ESA.2016.12},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/BienkowskiBBCDF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ByrkaRU16,
author = {Jaroslaw Byrka and
Bartosz Rybicki and
Sumedha Uniyal},
editor = {Quentin Louveaux and
Martin Skutella},
title = {An Approximation Algorithm for Uniform Capacitated k-Median Problem
with 1+{\textbackslash}epsilon Capacity Violation},
booktitle = {Integer Programming and Combinatorial Optimization - 18th International
Conference, {IPCO} 2016, Li{\`{e}}ge, Belgium, June 1-3, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9682},
pages = {262--274},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-33461-5\_22},
doi = {10.1007/978-3-319-33461-5\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ByrkaRU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ByrkaLM16,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Carsten Moldenhauer},
editor = {Rasmus Pagh},
title = {Approximation Algorithms for Node-Weighted Prize-Collecting Steiner
Tree Problems on Planar Graphs},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {2:1--2:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.2},
doi = {10.4230/LIPICS.SWAT.2016.2},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ByrkaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/AardalBM16,
author = {Karen I. Aardal and
Jaroslaw Byrka and
Mohammad Mahdian},
title = {Facility Location},
booktitle = {Encyclopedia of Algorithms},
pages = {717--724},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_139},
doi = {10.1007/978-1-4939-2864-4\_139},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/AardalBM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBM16,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marcin Mucha},
title = {Dynamic beats fixed: on phase-based algorithms for file migration},
journal = {CoRR},
volume = {abs/1609.00831},
year = {2016},
url = {http://arxiv.org/abs/1609.00831},
eprinttype = {arXiv},
eprint = {1609.00831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaLM16,
author = {Jaroslaw Byrka and
Mateusz Lewandowski and
Carsten Moldenhauer},
title = {Approximation algorithms for node-weighted prize-collecting Steiner
tree problems on planar graphs},
journal = {CoRR},
volume = {abs/1601.02481},
year = {2016},
url = {http://arxiv.org/abs/1601.02481},
eprinttype = {arXiv},
eprint = {1601.02481},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BienkowskiBCDNS15,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Neil B. Dobbs and
Tomasz Nowicki and
Maxim Sviridenko and
Grzegorz Swirszcz and
Neal E. Young},
title = {Approximation algorithms for the joint replenishment problem with
deadlines},
journal = {J. Sched.},
volume = {18},
number = {6},
pages = {545--560},
year = {2015},
url = {https://doi.org/10.1007/s10951-014-0392-y},
doi = {10.1007/S10951-014-0392-Y},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BienkowskiBCDNS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ByrkaKS15,
author = {Jaroslaw Byrka and
Andreas Karrenbauer and
Laura Sanit{\`{a}}},
title = {The interval constrained 3-coloring problem},
journal = {Theor. Comput. Sci.},
volume = {593},
pages = {42--50},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.04.037},
doi = {10.1016/J.TCS.2015.04.037},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ByrkaKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ByrkaPRSST15,
author = {Jaroslaw Byrka and
Thomas W. Pensyl and
Bartosz Rybicki and
Joachim Spoerhase and
Aravind Srinivasan and
Khoa Trinh},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {An Improved Approximation Algorithm for Knapsack Median Using Sparsification},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {275--287},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_24},
doi = {10.1007/978-3-662-48350-3\_24},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/ByrkaPRSST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/BienkowskiBCJK15,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Krzysztof Chrobak and
Tomasz Jurdzinski and
Dariusz R. Kowalski},
title = {Provable fairness for {TDMA} scheduling},
booktitle = {2015 {IEEE} Conference on Computer Communications, {INFOCOM} 2015,
Kowloon, Hong Kong, April 26 - May 1, 2015},
pages = {1320--1327},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/INFOCOM.2015.7218508},
doi = {10.1109/INFOCOM.2015.7218508},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/infocom/BienkowskiBCJK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ByrkaFRS15,
author = {Jaroslaw Byrka and
Krzysztof Fleszar and
Bartosz Rybicki and
Joachim Spoerhase},
editor = {Piotr Indyk},
title = {Bi-Factor Approximation Algorithms for Hard Capacitated \emph{k}-Median
Problems},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {722--736},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.49},
doi = {10.1137/1.9781611973730.49},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/ByrkaFRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ByrkaPRST15,
author = {Jaroslaw Byrka and
Thomas W. Pensyl and
Bartosz Rybicki and
Aravind Srinivasan and
Khoa Trinh},
editor = {Piotr Indyk},
title = {An Improved Approximation for \emph{k}-median, and Positive Correlation
in Budgeted Optimization},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {737--756},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.50},
doi = {10.1137/1.9781611973730.50},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ByrkaPRST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBBCDF15,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk'av{s} Folwarczn'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {Online Algorithms for Multi-Level Aggregation},
journal = {CoRR},
volume = {abs/1507.02378},
year = {2015},
url = {http://arxiv.org/abs/1507.02378},
eprinttype = {arXiv},
eprint = {1507.02378},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBBCDF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaRU15,
author = {Jaroslaw Byrka and
Bartosz Rybicki and
Sumedha Uniyal},
title = {An approximation algorithm for Uniform Capacitated k-Median problem
with 1 + {\(\epsilon\)} capacity violation},
journal = {CoRR},
volume = {abs/1511.07494},
year = {2015},
url = {http://arxiv.org/abs/1511.07494},
eprinttype = {arXiv},
eprint = {1511.07494},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaRU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BienkowskiBCJNS14,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Dorian Nogneng and
Jir{\'{\i}} Sgall},
editor = {Chandra Chekuri},
title = {Better Approximation Bounds for the Joint Replenishment Problem},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {42--54},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.4},
doi = {10.1137/1.9781611973402.4},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/BienkowskiBCJNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/RybickiB14,
author = {Bartosz Rybicki and
Jaroslaw Byrka},
editor = {Evripidis Bampis and
Ola Svensson},
title = {Improved Approximation Algorithm for Fault-Tolerant Facility Placement},
booktitle = {Approximation and Online Algorithms - 12th International Workshop,
{WAOA} 2014, Wroc{\l}aw, Poland, September 11-12, 2014, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8952},
pages = {59--70},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-18263-6\_6},
doi = {10.1007/978-3-319-18263-6\_6},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/RybickiB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/ByrkaS14,
author = {Jaroslaw Byrka and
Krzysztof Sornat},
editor = {Tie{-}Yan Liu and
Qi Qi and
Yinyu Ye},
title = {{PTAS} for Minimax Approval Voting},
booktitle = {Web and Internet Economics - 10th International Conference, {WINE}
2014, Beijing, China, December 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8877},
pages = {203--217},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13129-0\_15},
doi = {10.1007/978-3-319-13129-0\_15},
timestamp = {Sun, 18 Dec 2022 19:02:44 +0100},
biburl = {https://dblp.org/rec/conf/wine/ByrkaS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaPRST14,
author = {Jaroslaw Byrka and
Thomas W. Pensyl and
Bartosz Rybicki and
Aravind Srinivasan and
Khoa Trinh},
title = {An Improved Approximation for {\textdollar}k{\textdollar}-median,
and Positive Correlation in Budgeted Optimization},
journal = {CoRR},
volume = {abs/1406.2951},
year = {2014},
url = {http://arxiv.org/abs/1406.2951},
eprinttype = {arXiv},
eprint = {1406.2951},
timestamp = {Thu, 26 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ByrkaPRST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaS14,
author = {Jaroslaw Byrka and
Krzysztof Sornat},
title = {{PTAS} for Minimax Approval Voting},
journal = {CoRR},
volume = {abs/1407.7216},
year = {2014},
url = {http://arxiv.org/abs/1407.7216},
eprinttype = {arXiv},
eprint = {1407.7216},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ByrkaGRS13,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
title = {Steiner Tree Approximation via Iterative Randomized Rounding},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {6:1--6:33},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432628},
doi = {10.1145/2432622.2432628},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ByrkaGRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BienkowskiBCDNSSY13,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Neil B. Dobbs and
Tomasz Nowicki and
Maxim Sviridenko and
Grzegorz Swirszcz and
Neal E. Young},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Approximation Algorithms for the Joint Replenishment Problem with
Deadlines},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {135--147},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_12},
doi = {10.1007/978-3-642-39206-1\_12},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BienkowskiBCDNSSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BienkowskiBCJSS13,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Grzegorz Stachowiak},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Online Control Message Aggregation in Chain Networks},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {133--145},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_12},
doi = {10.1007/978-3-642-40104-6\_12},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BienkowskiBCJSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/ByrkaLR13,
author = {Jaroslaw Byrka and
Shanfei Li and
Bartosz Rybicki},
editor = {Christos Kaklamanis and
Kirk Pruhs},
title = {Improved Approximation Algorithm for k-Level {UFL} with Penalties,
a Simplistic View on Randomizing the Scaling Parameter},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8447},
pages = {85--96},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-08001-7\_8},
doi = {10.1007/978-3-319-08001-7\_8},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/ByrkaLR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBCJS13,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Better Approximation Bounds for the Joint Replenishment Problem},
journal = {CoRR},
volume = {abs/1307.2531},
year = {2013},
url = {http://arxiv.org/abs/1307.2531},
eprinttype = {arXiv},
eprint = {1307.2531},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBCJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaFRS13,
author = {Jaroslaw Byrka and
Krzysztof Fleszar and
Bartosz Rybicki and
Joachim Spoerhase},
title = {A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated
{\textdollar}k{\textdollar}-Median},
journal = {CoRR},
volume = {abs/1312.6550},
year = {2013},
url = {http://arxiv.org/abs/1312.6550},
eprinttype = {arXiv},
eprint = {1312.6550},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaFRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ByrkaLR13,
author = {Jaroslaw Byrka and
Shanfei Li and
Bartosz Rybicki},
title = {Improved approximation algorithm for k-level {UFL} with penalties,
a simplistic view on randomizing the scaling parameter},
journal = {CoRR},
volume = {abs/1310.2386},
year = {2013},
url = {http://arxiv.org/abs/1310.2386},
eprinttype = {arXiv},
eprint = {1310.2386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ByrkaLR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RybickiB13,
author = {Bartosz Rybicki and
Jaroslaw Byrka},
title = {Improved approximation algorithm for Fault-Tolerant Facility Placement},
journal = {CoRR},
volume = {abs/1311.6615},
year = {2013},
url = {http://arxiv.org/abs/1311.6615},
eprinttype = {arXiv},
eprint = {1311.6615},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RybickiB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchinBBNOSW12,
author = {Kevin Buchin and
Maike Buchin and
Jaroslaw Byrka and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Rodrigo I. Silveira and
Alexander Wolff},
title = {Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter
Tractability},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {309--332},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9456-3},
doi = {10.1007/S00453-010-9456-3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BuchinBBNOSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crowncom/SzydelkoBO12,
author = {Michal Szydelko and
Jaroslaw Byrka and
Jakub Oszmianski},
editor = {Jens Zander and
Riku J{\"{a}}ntti and
Min Song},
title = {Dynamic valuation function based definition of the primary spectrum
user in collocated cellular networks},
booktitle = {7th International Conference on Cognitive Radio Oriented Wireless
Networks, {CROWNCOM} 2012, Stockholm, Sweden, June 18-20, 2012},
pages = {297--302},
publisher = {{ICST} / {IEEE}},
year = {2012},
url = {https://doi.org/10.4108/icst.crowncom.2012.248463},
doi = {10.4108/ICST.CROWNCOM.2012.248463},
timestamp = {Sun, 08 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/crowncom/SzydelkoBO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ByrkaR12,
author = {Jaroslaw Byrka and
Bartosz Rybicki},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated
Facility Location},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {157--169},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_14},
doi = {10.1007/978-3-642-31594-7\_14},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ByrkaR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-3233,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak},
title = {Approximation Algorithms for the Joint Replenishment Problem with
Deadlines},
journal = {CoRR},
volume = {abs/1212.3233},
year = {2012},
url = {http://arxiv.org/abs/1212.3233},
eprinttype = {arXiv},
eprint = {1212.3233},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-3233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ByrkaGJ10,
author = {Jaroslaw Byrka and
Sylvain Guillemot and
Jesper Jansson},
title = {New results on optimizing rooted triplets consistency},
journal = {Discret. Appl. Math.},
volume = {158},
number = {11},
pages = {1136--1147},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.03.004},
doi = {10.1016/J.DAM.2010.03.004},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ByrkaGJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ByrkaGHK10,
author = {Jaroslaw Byrka and
Pawel Gawrychowski and
Katharina T. Huber and
Steven Kelk},
title = {Worst-case optimal approximation algorithms for maximizing triplet
consistency within phylogenetic networks},
journal = {J. Discrete Algorithms},
volume = {8},
number = {1},
pages = {65--75},
year = {2010},
url = {https://doi.org/10.1016/j.jda.2009.01.004},
doi = {10.1016/J.JDA.2009.01.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/ByrkaGHK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ByrkaA10,
author = {Jaroslaw Byrka and
Karen I. Aardal},
title = {An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated
Facility Location Problem},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2212--2231},
year = {2010},
url = {https://doi.org/10.1137/070708901},
doi = {10.1137/070708901},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ByrkaA10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BosseBM10,
author = {Hartwig Bosse and
Jaroslaw Byrka and
Evangelos Markakis},
title = {New algorithms for approximate Nash equilibria in bimatrix games},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {1},
pages = {164--173},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.09.023},
doi = {10.1016/J.TCS.2009.09.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BosseBM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/ByrkaSS10,
author = {Jaroslaw Byrka and
Aravind Srinivasan and
Chaitanya Swamy},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {Fault-Tolerant Facility Location: {A} Randomized Dependent LP-Rounding
Algorithm},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {244--257},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_19},
doi = {10.1007/978-3-642-13036-6\_19},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/ByrkaSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ByrkaKS10,
author = {Jaroslaw Byrka and
Andreas Karrenbauer and
Laura Sanit{\`{a}}},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {The Interval Constrained 3-Coloring Problem},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {591--602},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_51},
doi = {10.1007/978-3-642-12200-2\_51},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/ByrkaKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ByrkaGRS10,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
editor = {Leonard J. Schulman},
title = {An improved LP-based approximation for steiner tree},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {583--592},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806769},
doi = {10.1145/1806689.1806769},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ByrkaGRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-1295,
author = {Jaroslaw Byrka and
Aravind Srinivasan and
Chaitanya Swamy},
title = {Fault-Tolerant Facility Location: a randomized dependent LP-rounding
algorithm},
journal = {CoRR},
volume = {abs/1003.1295},
year = {2010},
url = {http://arxiv.org/abs/1003.1295},
eprinttype = {arXiv},
eprint = {1003.1295},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-1295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-3611,
author = {Jaroslaw Byrka and
Mohammadreza Ghodsi and
Aravind Srinivasan},
title = {LP-rounding algorithms for facility-location problems},
journal = {CoRR},
volume = {abs/1007.3611},
year = {2010},
url = {http://arxiv.org/abs/1007.3611},
eprinttype = {arXiv},
eprint = {1007.3611},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-3611.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BienkowskiBKH09,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Miroslaw Korzeniowski and
Friedhelm Meyer auf der Heide},
title = {Optimal algorithms for page migration in dynamic networks},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {545--569},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.07.006},
doi = {10.1016/J.JDA.2008.07.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BienkowskiBKH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-3563,
author = {Jaroslaw Byrka and
Andreas Karrenbauer and
Laura Sanit{\`{a}}},
title = {The interval constrained 3-coloring problem},
journal = {CoRR},
volume = {abs/0907.3563},
year = {2009},
url = {http://arxiv.org/abs/0907.3563},
eprinttype = {arXiv},
eprint = {0907.3563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-3563.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/BuchinBBNOSW08,
author = {Kevin Buchin and
Maike Buchin and
Jaroslaw Byrka and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Rodrigo I. Silveira and
Alexander Wolff},
editor = {Ioannis G. Tollis and
Maurizio Patrignani},
title = {Drawing (Complete) Binary Tanglegrams},
booktitle = {Graph Drawing, 16th International Symposium, {GD} 2008, Heraklion,
Crete, Greece, September 21-24, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5417},
pages = {324--335},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-642-00219-9\_32},
doi = {10.1007/978-3-642-00219-9\_32},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gd/BuchinBBNOSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ByrkaGJ08,
author = {Jaroslaw Byrka and
Sylvain Guillemot and
Jesper Jansson},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {New Results on Optimizing Rooted Triplets Consistency},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {484--495},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_44},
doi = {10.1007/978-3-540-92182-0\_44},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ByrkaGJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/AardalBM08,
author = {Karen I. Aardal and
Jaroslaw Byrka and
Mohammad Mahdian},
editor = {Ming{-}Yang Kao},
title = {Facility Location},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_139},
doi = {10.1007/978-0-387-30162-4\_139},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/AardalBM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-0920,
author = {Kevin Buchin and
Maike Buchin and
Jaroslaw Byrka and
Martin N{\"{o}}llenburg and
Yoshio Okamoto and
Rodrigo I. Silveira and
Alexander Wolff},
title = {Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter
Tractability},
journal = {CoRR},
volume = {abs/0806.0920},
year = {2008},
url = {http://arxiv.org/abs/0806.0920},
eprinttype = {arXiv},
eprint = {0806.0920},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-0920.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ByrkaA07,
author = {Jaroslaw Byrka and
Karen I. Aardal},
title = {The approximation gap for the metric facility location problem is
not yet closed},
journal = {Oper. Res. Lett.},
volume = {35},
number = {3},
pages = {379--384},
year = {2007},
url = {https://doi.org/10.1016/j.orl.2006.03.017},
doi = {10.1016/J.ORL.2006.03.017},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/ByrkaA07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Byrka07,
author = {Jaroslaw Byrka},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated
Facility Location Problem},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {29--43},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_3},
doi = {10.1007/978-3-540-74208-1\_3},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/Byrka07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BosseBM07,
author = {Hartwig Bosse and
Jaroslaw Byrka and
Evangelos Markakis},
editor = {Xiaotie Deng and
Fan Chung Graham},
title = {New Algorithms for Approximate Nash Equilibria in Bimatrix Games},
booktitle = {Internet and Network Economics, Third International Workshop, {WINE}
2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4858},
pages = {17--29},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77105-0\_6},
doi = {10.1007/978-3-540-77105-0\_6},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/BosseBM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0703010,
author = {Jaroslaw Byrka},
title = {An optimal bifactor approximation algorithm for the metric uncapacitated
facility location problem},
journal = {CoRR},
volume = {abs/cs/0703010},
year = {2007},
url = {http://arxiv.org/abs/cs/0703010},
eprinttype = {arXiv},
eprint = {cs/0703010},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0703010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BienkowskiB05,
author = {Marcin Bienkowski and
Jaroslaw Byrka},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Bucket Game with Applications to Set Multicover and Dynamic Page Migration},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {815--826},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_72},
doi = {10.1007/11561071\_72},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/BienkowskiB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-18 22:31 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
