scientific article; zbMATH DE number 1947060
From MaRDI portal
Publication:4411290
Recommendations
- Approximation Algorithms for Metric Facility Location Problems
- scientific article; zbMATH DE number 2086926
- scientific article; zbMATH DE number 1187151
- scientific article; zbMATH DE number 1670526
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Cited in
(66)- Approximation algorithms for connected facility 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
- 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
- Approximation algorithms for the robust facility leasing problem
- Towards flexible demands in online leasing problems
- Improved approximation algorithms for capacitated facility location problems
- Improved approximation algorithms for multilevel facility location problems
- A note on the maximization version of the multi-level facility location problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Connected facility location via random facility sampling and core detouring
- An approximation algorithm for the k-level facility location problem with outliers
- Concave connection cost facility location and the star inventory routing problem
- LP-based approximation for uniform capacitated facility location problem
- Mechanisms for dual-role-facility location games: truthfulness and approximability
- Approximation algorithms for the dynamic \(k\)-level facility location problems
- Cache me if you can: capacitated selfish replication games in networks
- A new approximation algorithm for the k-facility location problem
- On the bounded-hop MST problem on random Euclidean instances
- Approximation algorithms for \(k\)-level stochastic facility location problems
- An approximation algorithm for the dynamic facility location problem with outliers
- 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
- 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
- Asymmetry in \(k\)-center variants
- Incremental algorithms for facility location and \(k\)-median
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Approximation Algorithms for the Robust Facility Location Problem with Penalties
- New approximation algorithms for the unsplittable capacitated facility location problem
- Metric location problems with nonshortest service routes
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A General k-Level Uncapacitated Facility Location Problem
- scientific article; zbMATH DE number 1947043 (Why is no real title available?)
- Improved approximation of the general soft-capacitated facility location problem
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- An approximation algorithm for the soft-capacitated dynamic facility location problem
- An approximation algorithm for the squared metric dynamic facility location problem
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
- Improved Combinatorial Algorithms for Facility Location Problems
- Approximating the two-level facility location problem via a quasi-greedy approach
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- Inapproximability of the multi-level uncapacitated facility location problem
- An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem
- Theory and Applications of Models of Computation
- Approximation algorithms for hierarchical location problems
- Incremental facility location problem and its competitive algorithms
- Algorithm for \(k\)-product facility location problem with submodular penalties
- Respecting lower bounds in uniform lower and upper bounded facility location problem
- An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
- Approximation algorithm for the k-product uncapacitated facility location problem with penalties
- A simple and deterministic competitive algorithm for online facility location
- An LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Approximation algorithms for facility location problems with a special class of subadditive cost functions
- A primal-dual algorithm for online non-uniform facility location
- Approximation algorithm for facility location with service installation costs
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics
- Kinetic facility location
- Randomized priority algorithms
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 Q4411290)
