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

DOI10.1007/978-3-642-03367-4_22zbMATH Open1253.68171OpenAlexW1667714990MaRDI QIDQ3183459FDOQ3183459

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
• Database Theory - ICDT 2005
• Title not available (Why is that?)

Cited In (6)

• On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem
• 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
• Parameterized complexity of \(k\)-anonymity: hardness and tractability
• 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)