scientific article; zbMATH DE number 1947060

zbMath1013.90115MaRDI QIDQ4411290

Yinyu Ye, Mohammad Mahdian, Jia-Wei Zhang

Publication date: 7 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620229.htm

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items

Combinatorial approximation algorithms for the robust facility location problem with penalties, New approximation algorithms for the unsplittable capacitated facility location problem, A new approximation algorithm for the \(k\)-facility location problem, On the bounded-hop MST problem on random Euclidean instances, A hybrid multistart heuristic for the uncapacitated facility location problem, Approximation algorithms for facility location problems with a special class of subadditive cost functions, LP-based approximation for uniform capacitated facility location problem, Mechanisms for dual-role-facility location games: truthfulness and approximability, Incremental facility location problem and its competitive algorithms, Approximation algorithms for \(k\)-level stochastic facility location problems, Approximation Algorithms for the Robust Facility Location Problem with Penalties, An approximation algorithm for the dynamic facility location problem with outliers, An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities, A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem, Connected facility location via random facility sampling and core detouring, Unnamed Item, A primal-dual algorithm for online non-uniform facility location, Approximation algorithms for the dynamic \(k\)-level facility location problems, A \(k\)-product uncapacitated facility location problem, The \(k\)-level facility location game, The approximation gap for the metric facility location problem is not yet closed, On the competitive ratio for online facility location, Cost-sharing mechanisms for network design, Approximation algorithms for the robust facility leasing problem, Towards flexible demands in online leasing problems, Approximating \(k\)-hop minimum spanning trees in Euclidean metrics, Kinetic facility location, A simple and deterministic competitive algorithm for online facility location, Randomized priority algorithms, Improved approximation algorithms for capacitated facility location problems, Hedging uncertainty: approximation algorithms for stochastic optimization problems, Approximating the two-level facility location problem via a quasi-greedy approach, An approximation algorithm for a facility location problem with stochastic demands and inventories, A General k-Level Uncapacitated Facility Location Problem, Asymmetry in \(k\)-center variants, Incremental algorithms for facility location and \(k\)-median, An approximation algorithm for the \(k\)-level facility location problem with outliers, Cache me if you can: capacitated selfish replication games in networks, Approximation algorithms for connected facility location problems, Approximation algorithms for hierarchical location problems, Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems, A 6.55 factor primal-dual approximation algorithm for the connected facility location problem, Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem, Unnamed Item, A note on the maximization version of the multi-level facility location problem, Concave connection cost facility location and the star inventory routing problem