Incremental facility location problem and its competitive algorithms
type: Item
instance of: scholarly article
title: Incremental facility location problem and its competitive algorithms
zbMATH Open document ID: 1205.90242
author: Wenqiang Dai
author: Xianju Zeng
published in: Journal of Combinatorial Optimization
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5815480
zbMATH Keywords: analysis of algorithm
zbMATH Keywords: online algorithm
zbMATH Keywords: competitive ratio
MaRDI profile type: Publication
full work available at URL: s10878-009-9219-8
OpenAlex ID: W2032152618
cites work: Q4542527
cites work: Local search heuristic for k-median and facility location problems
cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
cites work: Q4527030
cites work: Better Bounds for Incremental Medians
cites work: Incremental medians via online bidding
cites work: Q3840357
cites work: Q4252386
cites work: Q4449209
cites work: An improved approximation ratio for the minimum latency problem
cites work: Greedy Strikes Back: Improved Facility Location Algorithms
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: A new greedy approach for facility location problems
cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
cites work: Q4411290
cites work: The Online Median Problem
cites work: Profit-earning facility location
cites work: Q4526991
cites work: Q4737531
cites work: A new approximation algorithm for the \(k\)-facility location problem
DOI: 10.1007/S10878-009-9219-8
description: scientific article; zbMATH DE number 5815480