research
∙
05/18/2023
Submodularity Gaps for Selected Network Design and Matching Problems
Submodularity in combinatorial optimization has been a topic of many stu...
share
research
∙
05/12/2023
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
We consider the well-studied Robust (k, z)-Clustering problem, which gen...
research
∙
05/09/2023
Sublogarithmic Approximation for Tollbooth Pricing on a Cactus
We study an envy-free pricing problem, in which each buyer wishes to buy...
research
∙
04/06/2023
Parameterized Approximation Schemes for Clustering with General Norm Objectives
This paper considers the well-studied algorithmic regime of designing a ...
research
∙
11/10/2022
An O(loglog n)-Approximation for Submodular Facility Location
In the Submodular Facility Location problem (SFL) we are given a collect...
research
∙
10/28/2021
Online Facility Location with Linear Delay
We study the problem of online facility location with delay. In this pro...
research
∙
11/16/2020
To Close Is Easier Than To Open: Dual Parameterization To k-Median
The k-Median problem is one of the well-known optimization problems that...
research
∙
12/02/2019
Concave connection cost Facility Location and the Star Inventory Routing problem
We study a variant of the uncapacitated facility location problem (UFL),...
research
∙
12/02/2019
PTAS for Steiner Tree on Map Graphs
We study the Steiner tree problem on map graphs, which substantially gen...
research
∙
11/06/2019
Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree
The basic goal of survivable network design is to build a cheap network ...
research
∙
11/05/2019
Unbounded lower bound for k-server against weak adversaries
We study the resource augmented version of the k-server problem, also kn...
research
∙
11/22/2018
Better Bounds for Online Line Chasing
We study online competitive algorithms for the line chasing problem in E...
research
∙
09/16/2018
Constant factor FPT approximation for capacitated k-median
Capacitated k-median is one of the few outstanding optimization problems...
research
∙
12/31/2017
Approximating Node-Weighted k-MST on Planar Graphs
We study the problem of finding a minimum weight connected subgraph span...
research
∙
12/18/2017
Approximation algorithms for stochastic and risk-averse optimization
We present improved approximation algorithms in stochastic optimization....
research
∙
11/06/2017