scientific article; zbMATH DE number 7378709

DOI10.4230/LIPICS.ESA.2018.39MaRDI QIDQ5009599zbMATH OpenFDO

Authors Gramoz Goranci, Dariusz Leniowski, Monika R. Henzinger

Publication date 4 August 2021

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

zbMATH Keywords

approximationdoubling dimensiondynamic algorithmfacility location

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Facility location on a tree with maximum distance constraints
• Facility location with tree topology and radial distance constraints
• Technical Note—A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees
• Locating Two Facilities on a Tree Subject to Distance Constraints
• On locating path- or tree-shaped facilities on networks
• The general facility location problem with connectivity on trees
• scientific article; zbMATH DE number 1947054
• scientific article; zbMATH DE number 5064928

Cites work

• (1 + )-approximation for facility location in data streams
• A 1.488 approximation algorithm for the uncapacitated facility location problem
• A primal-dual algorithm for online non-uniform facility location
• A simple and deterministic competitive algorithm for online facility location
• Algorithms for dynamic geometric problems over data streams
• Dynamic clustering to minimize the sum of radii
• Dynamic facility location via exponential clocks
• Facility Location in Dynamic Geometric Data Streams
• Facility location in evolving metrics
• Greedy Strikes Back: Improved Facility Location Algorithms
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• scientific article; zbMATH DE number 2086926 (Why is no real title available?)
• Infrastructure Leasing Problems
• Memoryless facility location in one pass
• Offline and online facility leasing
• On the competitive ratio for online facility location
• Profit-earning facility location
• Solving the dynamic facility location problem
• Towards the price of leasing online

Cited in

(5)

• Dynamic clustering to minimize the sum of radii
• scientific article; zbMATH DE number 7765379 (Why is no real title available?)
• On the Facility Location Problem in Online and Dynamic Models.
• Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center
• Fully dynamic sequential and distributed algorithms for MAX-CUT

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009599)