Approximation Algorithms for Minimum-Load k -Facility Location

DOI10.1145/3173047zbMATH Open1454.68175OpenAlexW2802493366MaRDI QIDQ4554343FDOQ4554343

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

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)

Cited In (1)

• Using \(\ell^p\)-norms for fairness in combinatorial optimisation

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)