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

DOI10.1007/978-3-642-03367-4_22zbMath1253.68171OpenAlexW1667714990MaRDI QIDQ3183459

David Eppstein, Wenliang Du, 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)

Related Items

On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem ⋮ Parameterized complexity of \(k\)-anonymity: hardness and tractability ⋮ Parameterized Complexity of k-Anonymity: Hardness and Tractability ⋮ Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates

Cites Work

• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
• Database Theory - ICDT 2005
• Unnamed Item
• Unnamed Item