- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss, Laura Sanità
- STOC '10
- 2010

The Steiner tree 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 a… (More)

The Steiner tree 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 a… (More)

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

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

- Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
- Discrete Applied Mathematics
- 2010

A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time approximability of two related… (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)

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)

- 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)

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)

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

The study of phylogenetic networks is of great interest to computational evolutionary biology and numerous different types of such structures are known. This article addresses the following question… (More)

- Kevin Buchin, Maike Buchin, +4 authors Alexander Wolff
- ArXiv
- 2008

A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for… (More)