All-Norms and All-L_p-Norms Approximation Algorithms

DOI10.4230/LIPIcs.FSTTCS.2008.1753zbMath1248.68558OpenAlexW1517616038MaRDI QIDQ3165959

Daniel Golovin, Amit Kumar, Anupam Gupta, Kanat Tangwongsan

Publication date: 19 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_d0ea.html

zbMATH Keywords

combinatorial optimizationapproximation algorithmssampling Minkowski normsset-cover problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (13)

Matroid and knapsack center problems ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ Universal Algorithms for Clustering Problems ⋮ Unnamed Item ⋮ Tight approximation algorithms for ordered covering ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines ⋮ A unified framework of FPT approximation algorithms for clustering problems ⋮ FPT Approximation for Constrained Metric k-Median/Means ⋮ Surrogate optimization for \(p\)-norms ⋮ Unnamed Item ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines

This page was built for publication: All-Norms and All-L_p-Norms Approximation Algorithms