default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBartosz Rybicki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j3]Jaroslaw Byrka
, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. Algorithmica 80(4): 1093-1114 (2018)- 2017
- [j2]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization. ACM Trans. Algorithms 13(2): 23:1-23:31 (2017) - [c8]Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki:
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. IPCO 2017: 173-185 - 2016
- [j1]Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki:
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties). Theory Comput. Syst. 58(1): 19-44 (2016) - [c7]Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal:
An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation. IPCO 2016: 262-274 - 2015
- [c6]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Joachim Spoerhase, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation Algorithm for Knapsack Median Using Sparsification. ESA 2015: 275-287 - [c5]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems. SODA 2015: 722-736 - [c4]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization. SODA 2015: 737-756 - [i6]Jaroslaw Byrka, Bartosz Rybicki, Sumedha Uniyal:
An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation. CoRR abs/1511.07494 (2015) - [i5]Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki:
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. CoRR abs/1512.09236 (2015) - 2014
- [c3]Bartosz Rybicki, Jaroslaw Byrka:
Improved Approximation Algorithm for Fault-Tolerant Facility Placement. WAOA 2014: 59-70 - [i4]Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization. CoRR abs/1406.2951 (2014) - 2013
- [c2]Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki:
Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter. WAOA 2013: 85-96 - [i3]Jaroslaw Byrka, Shanfei Li, Bartosz Rybicki:
Improved approximation algorithm for k-level UFL with penalties, a simplistic view on randomizing the scaling parameter. CoRR abs/1310.2386 (2013) - [i2]Bartosz Rybicki, Jaroslaw Byrka:
Improved approximation algorithm for Fault-Tolerant Facility Placement. CoRR abs/1311.6615 (2013) - [i1]Jaroslaw Byrka, Krzysztof Fleszar, Bartosz Rybicki, Joachim Spoerhase:
A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median. CoRR abs/1312.6550 (2013) - 2012
- [c1]Jaroslaw Byrka, Bartosz Rybicki:
Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location. ICALP (1) 2012: 157-169
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST 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:
