We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. The lexicographic minimax optimum is a concept that allows to find equitable location of facilities serving a large number of customers. The algorithm is independent of general purpose solvers and instead uses algorithms originally... https://www.lightemupsequences.com/special-pick-CHROME-HEARTS-HORSE-SHOE-LOGO-TANK-TOP-WHITE-best-find/