#### Filter Results:

- Full text PDF available (27)

#### Publication Year

2005

2017

- This year (4)
- Last 5 years (21)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jaroslaw Byrka
- APPROX-RANDOM
- 2007

We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1+2=e)-approximation algorithm of Chudak and Shmoys to obtain a new (1.6774,1.3738)approximationâ€¦ (More)

- Jaroslaw Byrka, Fabrizio Grandoni, Thomas RothvoÃŸ, Laura SanitÃ
- STOC
- 2010

The <i>Steiner tree</i> problem is one of the most fundamental NP-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. Inâ€¦ (More)

- Hartwig Bosse, Jaroslaw Byrka, Evangelos Markakis
- Theor. Comput. Sci.
- 2007

We consider the problem of computing additively approximate Nash equilibria in noncooperative two-player games. We provide a new polynomial time algorithm that achieves an approximation guarantee ofâ€¦ (More)

- Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
- IPCO
- 2010

We give a new randomized LP-rounding 1.725-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best knownâ€¦ (More)

- Jaroslaw Byrka, Mohammadreza Ghodsi, Aravind Srinivasan
- ArXiv
- 2010

We study LP-rounding approximation algorithms for metric uncapacitated facility-location problems. We first give a new analysis for the algorithm of Chudak and Shmoys, which differs from the analysisâ€¦ (More)

- Jaroslaw Byrka, Fabrizio Grandoni, Thomas RothvoÃŸ, Laura SanitÃ
- J. ACM
- 2013

The Steiner tree problem is one of the most fundamental <b>NP</b>-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum-cost tree spanning the terminals. Inâ€¦ (More)

- Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. Huber, Steven Kelk
- J. Discrete Algorithms
- 2010

This article concerns the following question arising in computational evolutionary biology. For a given subclass of phylogenetic networks, what is the maximum value of 0 â‰¤ p â‰¤ 1 such that for everyâ€¦ (More)

- Jaroslaw Byrka, Thomas Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh
- ACM Trans. Algorithms
- 2015

Dependent rounding is a useful technique for optimization problems with hard budget constraints. This framework naturally leads to negative correlation properties. However, what if an applicationâ€¦ (More)

In the classical k-median problem the goal is to select a subset of at most k facilities in order to minimize the total cost of opened facilities and established connections between clients andâ€¦ (More)

The Joint Replenishment Problem (JRP) deals with optimizing shipments of goods from a supplier to retailers through a shared warehouse. Each shipment involves transporting goods from the supplier toâ€¦ (More)