IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i1d10.1007_s10878-009-9277-y.html
   My bibliography  Save this article

Anonymizing binary and small tables is hard to approximate

Author

Listed:
  • Paola Bonizzoni

    (Università degli Studi di Milano-Bicocca)

  • Gianluca Della Vedova

    (Università degli Studi di Milano-Bicocca)

  • Riccardo Dondi

    (Università degli Studi di Bergamo)

Abstract

The problem of publishing personal data without giving up privacy is becoming increasingly important. An interesting formalization recently proposed is the k-anonymity. This approach requires that the rows in a table are clustered in sets of size at least k and that all the rows in a cluster become the same tuple, after the suppression of some records. The natural optimization problem, where the goal is to minimize the number of suppressed entries, is known to be NP-hard when the values are over a ternary alphabet, k=3 and the rows length is unbounded. In this paper we give a lower bound on the approximation factor that any polynomial-time algorithm can achieve on two restrictions of the problem, namely (i) when the records values are over a binary alphabet and k=3, and (ii) when the records have length at most 8 and k=4, showing that these restrictions of the problem are APX-hard.

Suggested Citation

  • Paola Bonizzoni & Gianluca Della Vedova & Riccardo Dondi, 2011. "Anonymizing binary and small tables is hard to approximate," Journal of Combinatorial Optimization, Springer, vol. 22(1), pages 97-119, July.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:1:d:10.1007_s10878-009-9277-y
    DOI: 10.1007/s10878-009-9277-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9277-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-009-9277-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Paola Bonizzoni & Gianluca Della Vedova & Riccardo Dondi & Yuri Pirola, 2013. "Parameterized complexity of k-anonymity: hardness and tractability," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 19-43, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:22:y:2011:i:1:d:10.1007_s10878-009-9277-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.