scientific article; zbMATH DE number 7378691
From MaRDI portal
Publication:5009578
DOI10.4230/LIPIcs.ESA.2018.21MaRDI QIDQ5009578
Piotr Sankowski, Marek Cygan, Marcin Mucha, Artur Czumaj
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1807.03839
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ The power of amortized recourse for online graph problems ⋮ Unnamed Item ⋮ On the Facility Location Problem in Online and Dynamic Models.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online network design with outliers
- Online facility location with facility movements
- Incremental facility location problem and its competitive algorithms
- A simple and deterministic competitive algorithm for online facility location
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
- A primal-dual algorithm for online non-uniform facility location
- Offline and online facility leasing
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- On the competitive ratio for online facility location
- Incremental algorithms for facility location and \(k\)-median
- Set Covering with Our Eyes Closed
- Spectral Sparsification in Dynamic Graph Streams
- The Power of Dynamic Distance Oracles
- Spanners and sparsifiers in dynamic streams
- A general approach to online network optimization problems
- LP-Based Algorithms for Capacitated Facility Location
- Single Pass Spectral Sparsification in Dynamic Streams
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Facility Location in Dynamic Geometric Data Streams
- Algorithms for dynamic geometric problems over data streams
- Coresets in dynamic geometric data streams
- The Online Median Problem
- Dynamic Facility Location via Exponential Clocks
- Profit-earning facility location
- Online Network Design Algorithms via Hierarchical Decompositions
- Online Steiner Tree with Deletions
- Obtaining online approximation algorithms for facility dispersion from offline algorithms
- Automata, Languages and Programming
- (1 + ε)-Approximation for Facility Location in Data Streams
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication:
