| An improved LP-based approximation for Steiner tree J Byrka, F Grandoni, T Rothvoß, L Sanità Proceedings of the 42nd ACM symposium on Theory of computing, 583-592, 2010 | 398 | 2010 |
| An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization J Byrka, T Pensyl, B Rybicki, A Srinivasan, K Trinh ACM Transactions on Algorithms (TALG) 13 (2), 1-31, 2017 | 323 | 2017 |
| Steiner tree approximation via iterative randomized rounding J Byrka, F Grandoni, T Rothvoß, L Sanità Journal of the ACM (JACM) 60 (1), 1-33, 2013 | 320 | 2013 |
| An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem J Byrka, K Aardal SIAM Journal on Computing 39 (6), 2212-2231, 2010 | 183 | 2010 |
| An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem J Byrka Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2007 | 155 | 2007 |
| New algorithms for approximate Nash equilibria in bimatrix games H Bosse, J Byrka, E Markakis Proceedings of the 3rd international conference on Internet and network …, 2007 | 76 | 2007 |
| New results on optimizing rooted triplets consistency J Byrka, S Guillemot, J Jansson Discrete Applied Mathematics 158 (11), 1136-1147, 2010 | 75 | 2010 |
| Fault-tolerant facility location: a randomized dependent LP-rounding algorithm J Byrka, A Srinivasan, C Swamy Integer Programming and Combinatorial Optimization, 244-257, 2010 | 68 | 2010 |
| Drawing (complete) binary tanglegrams K Buchin, M Buchin, J Byrka, M Nöllenburg, Y Okamoto, R Silveira, ... Graph Drawing, 324-335, 2009 | 66* | 2009 |
| Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems J Byrka, K Fleszar, B Rybicki, J Spoerhase Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 64 | 2014 |
| New algorithms for approximate Nash equilibria in bimatrix games H Bosse, J Byrka, E Markakis Theoretical Computer Science 411 (1), 164-173, 2010 | 59 | 2010 |
| Better approximation bounds for the joint replenishment problem M Bienkowski, J Byrka, M Chrobak, Ł Jeż, D Nogneng, J Sgall Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014 | 56 | 2014 |
| An Approximation Algorithm for Uniform Capacitated k-Median Problem with Capacity Violation J Byrka, B Rybicki, S Uniyal International Conference on Integer Programming and Combinatorial …, 2016 | 53 | 2016 |
| Breaching the 2-approximation barrier for connectivity augmentation: a reduction to steiner tree J Byrka, F Grandoni, AJ Ameli Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 44 | 2020 |
| Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks J Byrka, P Gawrychowski, KT Huber, S Kelk Journal of Discrete Algorithms 8 (1), 65-75, 2010 | 44 | 2010 |
| Constant factor FPT approximation for capacitated k-median M Adamczyk, J Byrka, J Marcinkowski, SM Meesum, M Włodarczyk arXiv preprint arXiv:1809.05791, 2018 | 42 | 2018 |
| Online algorithms for multi-level aggregation M Bienkowski, M Böhm, J Byrka, M Chrobak, C Dürr, L Folwarczný, Ł Jeż, ... arXiv preprint arXiv:1507.02378, 2015 | 38 | 2015 |
| Constant-factor approximation for ordered k-median J Byrka, K Sornat, J Spoerhase Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 37 | 2018 |
| Approximation algorithms for the joint replenishment problem with deadlines M Bienkowski, J Byrka, M Chrobak, N Dobbs, T Nowicki, M Sviridenko, ... Journal of Scheduling 18 (6), 545-560, 2015 | 35 | 2015 |
| Proportional approval voting, harmonic k-median, and negative association J Byrka, P Skowron, K Sornat arXiv preprint arXiv:1704.02183, 2017 | 30 | 2017 |
Marcin BienkowskiUniversity of Wroclawcs.uni.wroc.pl의 이메일 확인됨
