Approximation algorithms for min-max generalization problems

DOI10.1007/978-3-642-15369-3_5MaRDI QIDQ3588399zbMATH OpenOpenAlexFDO

Authors Piotr Berman, Sofya Raskhodnikova

Publication date 10 September 2010

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15369-3_5

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for min-max generalization problems
• Max-min partitioning of grid graphs into connected components
• A generalized minimum cost k-clustering
• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
• Approximation algorithms for min-sum \(p\)-clustering

Cited in

(3)

• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
• Approximation algorithms for min-max generalization problems
• Approximating Minimization Diagrams and Generalized Proximity Search

This page was built for publication: Approximation algorithms for min-max generalization problems

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