Primal-dual algorithms for connected facility location problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1947062
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- Approximation algorithms for connected facility location problems
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Dual-based local search for the connected facility location and related problems
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- scientific article; zbMATH DE number 3885614
- Improved Approximation Algorithm for Connected Facility Location Problems
- Approximate the lower-bounded connected facility location problem
Cited in
(47)- Approximation algorithms for prize-collecting capacitated network design problems
- Construction Line Algorithms for the Connection Location-Allocation Problem
- Branch‐and‐cut algorithms for the ‐arborescence star problem
- Connected fair domination in graphs
- A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information
- Deterministic sampling algorithms for network design
- An exact algorithm for the maximum leaf spanning tree problem
- Black-box reductions for cost-sharing mechanism design
- Approximate robust optimization for the connected facility location problem
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- A PTAS framework for clustering problems in doubling metrics
- The A priori traveling repairman problem
- Approximation algorithms for soft-capacitated facility location in capacitated network design
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- MIP models for connected facility location: a theoretical and computational study
- General network design: a unified view of combined location and network design problems
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- Benders decomposition of the passive optical network design problem
- Routing under uncertainty: the \textit{a priori} traveling repairman problem
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
- scientific article; zbMATH DE number 1947062 (Why is no real title available?)
- Minimum connected dominating set and backbone of a random graph
- Approximation schemes for \(k\)-facility location
- Black-box reductions for cost-sharing mechanism design
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- The online connected facility location problem
- Improved Approximation Algorithm for Connected Facility Location Problems
- Solving connected dominating set faster than \(2^n\)
- Branch-and-cut-and-price for capacitated connected facility location
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- The p-arborescence star problem: formulations and exact solution approaches
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Connected facility location via random facility sampling and core detouring
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- A PTAS for the geometric connected facility location problem
- Approximate the lower-bounded connected facility location problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- An algorithmic framework for the exact solution of tree-star problems
- Optimal data placement on networks with a constant number of clients
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
- Dual-based local search for the connected facility location and related problems
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- Approximation algorithms for connected facility location problems
This page was built for publication: Primal-dual algorithms for connected facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884770)
