On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
From MaRDI portal
Publication:3183459
DOI10.1007/978-3-642-03367-4_22zbMath1253.68171MaRDI QIDQ3183459
George S. Lueker, David Eppstein, Michael T. Goodrich, Wenliang Du
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68W25: Approximation algorithms
Related Items
Parameterized Complexity of k-Anonymity: Hardness and Tractability, On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
Cites Work