scientific article; zbMATH DE number 7378709

DOI10.4230/LIPIcs.ESA.2018.39MaRDI QIDQ5009599

Gramoz Goranci, Dariusz Leniowski, Monika R. Henzinger

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1909.06653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationfacility locationdoubling dimensiondynamic algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Dynamic clustering to minimize the sum of radii ⋮ Unnamed Item ⋮ On the Facility Location Problem in Online and Dynamic Models.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards the price of leasing online
• A simple and deterministic competitive algorithm for online facility location
• 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
• Memoryless facility location in one pass
• Facility Location in Dynamic Geometric Data Streams
• Algorithms for dynamic geometric problems over data streams
• Greedy Strikes Back: Improved Facility Location Algorithms
• Facility Location in Evolving Metrics
• Profit-earning facility location
• Dynamic Facility Location via Exponential Clocks
• Infrastructure Leasing Problems
• Solving the dynamic facility location problem
• (1 + ε)-Approximation for Facility Location in Data Streams

This page was built for publication: