On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem

DOI10.1007/978-3-642-03367-4_22MaRDI QIDQ3183459zbMATH OpenOpenAlexFDO

Authors Wenliang Du, David Eppstein, George S. Lueker, Michael T. Goodrich

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for min-max generalization problems
• Anonymizing binary and small tables is hard to approximate
• Database Theory - ICDT 2005
• Approximation algorithms for min-max generalization problems
• Achieving anonymity via clustering

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303579 (Why is no real title available?)
• Database Theory - ICDT 2005
• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem

Cited in

(6)

• Parameterized complexity of \(k\)-anonymity: hardness and tractability
• Approximation algorithms for min-max generalization problems
• Approximation algorithms for min-max generalization problems
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
• Parameterized complexity of \(k\)-anonymity: hardness and tractability

This page was built for publication: On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem

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