Approximation algorithms for minimum-load k-facility location

DOI10.1145/3173047MaRDI QIDQ4554343zbMATH OpenOpenAlexFDO

Authors Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad Salavatipour, Chaitanya Swamy

Publication date 13 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3173047

zbMATH Keywords

approximation algorithmslower boundpolynomial-time approximation schememin-max star coverminimum load k-facility location

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for minimum-load \(k\)-facility location
• scientific article; zbMATH DE number 1559542
• A local search approximation algorithm for a squared metric \(k\)-facility location problem
• A local search approximation algorithm for a squared metric \(k\)-facility location problem
• Approximation Algorithms for Metric Facility Location Problems

Cited in

(2)

• Using \(\ell^p\)-norms for fairness in combinatorial optimisation
• Approximation algorithms for minimum-load \(k\)-facility location

This page was built for publication: Approximation algorithms for minimum-load \(k\)-facility location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554343)