On the Complexity of the l-diversity Problem

DOI10.1007/978-3-642-22993-0_26zbMath1343.68108OpenAlexW1787195807WikidataQ57518499 ScholiaQ57518499MaRDI QIDQ3088046

Giancarlo Mauri, Italo Zoppis, Riccardo Dondi

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_26

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

The \(l\)-diversity problem: tractability and approximability

This page was built for publication: On the Complexity of the l-diversity Problem