Jaroslaw Byrka

Fabrizio Grandoni

Afrouz Jabal Ameli

SIAM J. Comput., June, 2023

Submodularity Gaps for Selected Network Design and Matching Problems.

[BibT_eX]

[DOI]

CoRR, 2023

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces.

[BibT_eX]

[DOI]

CoRR, 2023

Sublogarithmic Approximation for Tollbooth Pricing on a Cactus.

[BibT_eX]

[DOI]

Andrzej Turko

CoRR, 2023

Parameterized Approximation Schemes for Clustering with General Norm Objectives.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

An O(loglog n)-Approximation for Submodular Facility Location.

[BibT_eX]

[DOI]

CoRR, 2022

Online Facility Location with Linear Delay.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2022

2021

New results on multi-level aggregation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2020

Approximating Node-Weighted k-MST on Planar Graphs.

[BibT_eX]

[DOI]

Mateusz Lewandowski

Joachim Spoerhase

Theory Comput. Syst., 2020

Online Algorithms for Multilevel Aggregation.

[BibT_eX]

[DOI]

Oper. Res., 2020

Concave Connection Cost Facility Location and the Star Inventory Routing Problem.

[BibT_eX]

[DOI]

Mateusz Lewandowski

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

To Close Is Easier Than To Open: Dual Parameterization To k-Median.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

Unbounded lower bound for k-server against weak adversaries.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

PTAS for Steiner Tree on Map Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

Dynamic Beats Fixed: On Phase-based Algorithms for File Migration.

[BibT_eX]

[DOI]

Marcin Mucha

ACM Trans. Algorithms, 2019

Better Bounds for Online Line Chasing.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Constant-Factor FPT Approximation for Capacitated k-Median.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Approximation Algorithms for Stochastic and Risk-Averse Optimization.

[BibT_eX]

[DOI]

Aravind Srinivasan

SIAM J. Discret. Math., 2018

An Improved Approximation Algorithm for Knapsack Median Using Sparsification.

[BibT_eX]

[DOI]

Algorithmica, 2018

Constant-factor approximation for ordered k-median.

[BibT_eX]

[DOI]

Krzysztof Sornat

Joachim Spoerhase

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Proportional Approval Voting, Harmonic k-median, and Negative Association.

[BibT_eX]

[DOI]

Piotr Skowron

Krzysztof Sornat

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

An Improved Approximation for <i>k</i>-Median and Positive Correlation in Budgeted Optimization.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

2016

Facility Location.

[BibT_eX]

[DOI]

Mohammad Mahdian

Encyclopedia of Algorithms, 2016

Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties).

[BibT_eX]

[DOI]

Shanfei Li

Theory Comput. Syst., 2016

Approximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs.

[BibT_eX]

[DOI]

Mateusz Lewandowski

Carsten Moldenhauer

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

An Approximation Algorithm for Uniform Capacitated k-Median Problem with 1+\epsilon Capacity Violation.

[BibT_eX]

[DOI]

Sumedha Uniyal

Proceedings of the Integer Programming and Combinatorial Optimization, 2016

Online Algorithms for Multi-Level Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

The interval constrained 3-coloring problem.

[BibT_eX]

[DOI]

Andreas Karrenbauer

Laura Sanità

Theor. Comput. Sci., 2015

Approximation algorithms for the joint replenishment problem with deadlines.

[BibT_eX]

[DOI]

J. Sched., 2015

An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation.

[BibT_eX]

[DOI]

Sumedha Uniyal

CoRR, 2015

Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Provable fairness for TDMA scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014

An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization.

[BibT_eX]

[DOI]

CoRR, 2014

PTAS for Minimax Approval Voting.

[BibT_eX]

[DOI]

Krzysztof Sornat

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Improved Approximation Algorithm for Fault-Tolerant Facility Placement.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Steiner Tree Approximation via Iterative Randomized Rounding.

[BibT_eX]

[DOI]

J. ACM, 2013

A Constant-Factor Approximation Algorithm for Uniform Hard Capacitated $k$-Median.

[BibT_eX]

[DOI]

CoRR, 2013

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

CoRR, 2013

Improved Approximation Algorithm for k-Level UFL with Penalties, a Simplistic View on Randomizing the Scaling Parameter.

[BibT_eX]

[DOI]

Shanfei Li

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Online Control Message Aggregation in Chain Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Approximation Algorithms for the Joint Replenishment Problem with Deadlines

[BibT_eX]

[DOI]

Marek Chrobak

CoRR, 2012

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.

[BibT_eX]

[DOI]

Algorithmica, 2012

Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Dynamic valuation function based definition of the primary spectrum user in collocated cellular networks.

[BibT_eX]

[DOI]

Michal Szydelko

Jakub Oszmianski

Proceedings of the 7th International Conference on Cognitive Radio Oriented Wireless Networks, 2012

2010

New algorithms for approximate Nash equilibria in bimatrix games.

[BibT_eX]

[DOI]

Hartwig Bosse

Evangelos Markakis

Theor. Comput. Sci., 2010

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2010

New results on optimizing rooted triplets consistency.

[BibT_eX]

[DOI]

Sylvain Guillemot

Jesper Jansson

Discret. Appl. Math., 2010

LP-rounding algorithms for facility-location problems

[BibT_eX]

[DOI]

Mohammadreza Ghodsi

Aravind Srinivasan

CoRR, 2010

An improved LP-based approximation for steiner tree.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm.

[BibT_eX]

[DOI]

Aravind Srinivasan

Chaitanya Swamy

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

2009

Optimal algorithms for page migration in dynamic networks.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Miroslaw Korzeniowski

J. Discrete Algorithms, 2009

2008

Facility Location.

[BibT_eX]

[DOI]

Mohammad Mahdian

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Drawing (Complete) Binary Tanglegrams.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

The approximation gap for the metric facility location problem is not yet closed.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2005

Bucket Game with Applications to Set Multicover and Dynamic Page Migration.

[BibT_eX]

[DOI]