Incremental facility location problem and its competitive algorithms
From MaRDI portal
Publication:604759
DOI10.1007/S10878-009-9219-8zbMATH Open1205.90242OpenAlexW2032152618MaRDI QIDQ604759FDOQ604759
Authors: Wenqiang Dai, Xianju Zeng 
Publication date: 12 November 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9219-8
Recommendations
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new approximation algorithm for the \(k\)-facility location problem
- Title not available (Why is that?)
- An improved approximation ratio for the minimum latency problem
- A new greedy approach for facility location problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Online Median Problem
- Local search heuristic for k-median and facility location problems
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- Incremental medians via online bidding
- Profit-earning facility location
- Title not available (Why is that?)
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Title not available (Why is that?)
- Better Bounds for Incremental Medians
Cited In (12)
- On the competitive ratio for online facility location
- Incremental medians via online bidding
- The Online Median Problem
- Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
- Better Bounds for Incremental Medians
- Title not available (Why is that?)
- An improved competitive algorithm for one-dimensional incremental median problem
- Incremental algorithms for facility location and \(k\)-median
- Algorithms – ESA 2004
- A 16-competitive algorithm for hierarchical median problem
- Better bounds for incremental medians
- Online economic ordering problem for deteriorating items with limited price information
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)
