
Online Facility Location with Linear Delay
We study the problem of online facility location with delay. In this pro...
read it

To Close Is Easier Than To Open: Dual Parameterization To kMedian
The kMedian problem is one of the wellknown optimization problems that...
read it

Concave connection cost Facility Location and the Star Inventory Routing problem
We study a variant of the uncapacitated facility location problem (UFL),...
read it

PTAS for Steiner Tree on Map Graphs
We study the Steiner tree problem on map graphs, which substantially gen...
read it

Breaching the 2Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree
The basic goal of survivable network design is to build a cheap network ...
read it

Unbounded lower bound for kserver against weak adversaries
We study the resource augmented version of the kserver problem, also kn...
read it

Better Bounds for Online Line Chasing
We study online competitive algorithms for the line chasing problem in E...
read it

Constant factor FPT approximation for capacitated kmedian
Capacitated kmedian is one of the few outstanding optimization problems...
read it

Approximating NodeWeighted kMST on Planar Graphs
We study the problem of finding a minimum weight connected subgraph span...
read it

Approximation algorithms for stochastic and riskaverse optimization
We present improved approximation algorithms in stochastic optimization....
read it

ConstantFactor Approximation for Ordered kMedian
We study the Ordered kMedian problem, in which the solution is evaluate...
read it
Jaroslaw Byrka
is this you? claim profile