Incremental facility location problem and its competitive algorithms
From MaRDI portal
(Redirected from Publication:604759)
Recommendations
Cites work
- scientific article; zbMATH DE number 1187151 (Why is no real title available?)
- scientific article; zbMATH DE number 1305496 (Why is no real title available?)
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- scientific article; zbMATH DE number 2038744 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 1559578 (Why is no real title available?)
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- A new approximation algorithm for the \(k\)-facility location problem
- A new greedy approach for facility location problems
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- An improved approximation ratio for the minimum latency problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Better Bounds for Incremental Medians
- Greedy Strikes Back: Improved Facility Location Algorithms
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Incremental medians via online bidding
- Local search heuristic for k-median and facility location problems
- Profit-earning facility location
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- The Online Median Problem
Cited in
(15)- Algorithms – ESA 2004
- On the competitive ratio for online facility location
- Better bounds for incremental medians
- An incremental version of the \(k\)-center problem on boundary of a convex polygon
- Incremental medians via online bidding
- An approximation algorithm for the Euclidean incremental median problem
- Online economic ordering problem for deteriorating items with limited price information
- An incremental algorithm for the uncapacitated facility location problem
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Incremental algorithms for facility location and \(k\)-median
- The Online Median Problem
- A 16-competitive algorithm for hierarchical median problem
- Better Bounds for Incremental Medians
- An improved competitive algorithm for one-dimensional incremental median problem
- Online facility location with deletions
This page was built for publication: Incremental facility location problem and its competitive algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604759)
