Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese

dblp
dblp
dblp
dblp

Not MPG Author(s):

Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf

Editor(s):

Owe, Olaf
Steffen, Martin
Telle, Jan Arne

dblp
dblp
dblp

Not MPII Editor(s):

Owe, Olaf
Steffen, Martin
Telle, Jan Arne

BibTeX cite key*:

BredereckNichterleinNiedermeierPhilip2011b

Title, Booktitle

Title*:

The Effect of Homogeneity on the Complexity of $k$-Anonymity


anon.pdf (600.06 KB)

Booktitle*:

Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings

Event, URLs

URL of the conference:

http://fct11.ifi.uio.no/

URL for downloading the paper:

http://www.springerlink.com/content/w65771qj7n672v11/fulltext.pdf

Event Address*:

Oslo, Norway

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

22 August 2011

Event End Date:

25 August 2011

Publisher

Name*:

Springer

URL:

http://www.springer.com

Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

6914

Number:


Month:


Pages:

53-64

Year*:

2011

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:

978-3-642-22952-7



Note, Abstract, ©


(LaTeX) Abstract:

The NP-hard \textsc{$k$-Anonymity}
problem asks, given an~$n \times m$-matrix~$M$ over a
fixed alphabet and an integer~$s>0$, whether~$M$ can be made
$k$-anonymous by suppressing (blanking out) at most~$s$
entries. A matrix~$M$ is said to be $k$-anonymous if for each
row~$r$ in~$M$ there are at least~$k-1$ other rows in~$M$ which
are identical to~$r$. Complementing previous work, we introduce two new
``data-driven'' parameterizations for \textsc{$k$-Anonymity}---the number~$\tin$ of
different input rows and the number~$\tout$ of different output rows---both
modeling aspects of data homogeneity. We show that \textsc{$k$-Anonymity}
is fixed-parameter tractable for the parameter~$\tin$, and it is
NP-hard even for~$\tout = 2$ and alphabet size four.
Notably, our fixed-parameter tractability result implies that
\textsc{$k$-Anonymity} can be solved in \emph{linear time} when~$\tin$ is a
constant. Our results also extend to some interesting
generalizations of \textsc{$k$-Anonymity}.

URL for the Abstract:

http://www.springerlink.com/content/w65771qj7n672v11/

Keywords:

Parameterized Algorithms, $k$-Anonymity

Copyright Message:

Copyright Springer Berlin 2011. This work is subject to copyright. All rights are reserved, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965,
in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law.

Published in the Proceedings of FCT 2011, Oslo, Norway, August 22-25, 2011. Lecture Notes in Computer Science, Volume 6914. The original publication is available at www.springerlink.com : http://www.springerlink.com/content/w65771qj7n672v11/


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{BredereckNichterleinNiedermeierPhilip2011b,
AUTHOR = {Bredereck, Robert and Nichterlein, Andr{\'e} and Niedermeier, Rolf and Philip, Geevarghese},
EDITOR = {Owe, Olaf and Steffen, Martin and Telle, Jan Arne},
TITLE = {The Effect of Homogeneity on the Complexity of $k$-Anonymity},
BOOKTITLE = {Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
PUBLISHER = {Springer},
YEAR = {2011},
VOLUME = {6914},
PAGES = {53--64},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Oslo, Norway},
DOI = {978-3-642-22952-7},
}


Entry last modified by Geevarghese Philip, 07/08/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
04/22/2012 03:12:49 PM
Revision
1.
0.


Editor
Geevarghese Philip
Geevarghese Philip


Edit Date
12/08/2012 04:41:16 AM
04/22/2012 03:12:49 PM


Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
anon.pdf