Approximation Algorithms for Min-Max Generalization Problems

DOI10.1145/2636920zbMath1398.68660OpenAlexW2032415540MaRDI QIDQ4962163

Sofya Raskhodnikova, Piotr Berman

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2636920

zbMATH Keywords

bin covering\(k\)-anonymityrectangle tilinggeneralization problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25)

This page was built for publication: Approximation Algorithms for Min-Max Generalization Problems