Approximation algorithms for minimum norm and ordered optimization problems

DOI10.1145/3313276.3316322zbMath1433.68612arXiv1811.05022OpenAlexW2963120985MaRDI QIDQ5212754

Chaitanya Swamy, Deeparnab Chakrabarty

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.05022

zbMATH Keywords

clusteringapproximation algorithmload balancingminimum norm optimizationordered optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (8)

Approximation algorithms for clustering with dynamic points ⋮ On clustering with discounts ⋮ Universal Algorithms for Clustering Problems ⋮ Unnamed Item ⋮ Tight approximation algorithms for ordered covering ⋮ Simpler and Better Algorithms for Minimum-Norm Load Balancing ⋮ Approximate multi-matroid intersection via iterative refinement ⋮ Reverse greedy is bad for \(k\)-center

This page was built for publication: Approximation algorithms for minimum norm and ordered optimization problems