<div class="csl-bib-body">
<div class="csl-entry">Blažej, V., Ganian, R., Knop, D., Pokorný, J., Schierreich, Š., & Simonov, K. (2023). The Parameterized Complexity of Network Microaggregation. In B. Williams, Y. Chen, & J. Neville (Eds.), <i>Proceedings of the 37th AAAI Conference on Artificial Intelligence</i> (pp. 6262–6270). AAAI Press. https://doi.org/10.1609/aaai.v37i5.25771</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/188985
-
dc.description.abstract
Microaggregation is a classical statistical disclosure control technique which requires the input data to be partitioned into clusters while adhering to specified size constraints. We provide novel exact algorithms and lower bounds for the task of microaggregating a given network while considering both unrestricted and connected clusterings, and analyze these from the perspective of the parameterized complexity paradigm. Altogether, our results assemble a complete complexity-theoretic picture for the network microaggregation problem with respect to the most natural parameterizations of the problem, including input-specified parameters capturing the size and homogeneity of the clusters as well as the treewidth and vertex cover number of the network.
en
dc.language.iso
en
-
dc.relation.ispartofseries
Proceedings of the ... AAAI Conference on Artificial Intelligence
-
dc.subject
Network Microaggregation
en
dc.subject
Parameterized Complexity
en
dc.title
The Parameterized Complexity of Network Microaggregation
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.contributor.affiliation
Czech Technical University in Prague, Czechia
-
dc.contributor.affiliation
Czech Technical University in Prague, Czechia
-
dc.contributor.affiliation
Czech Technical University in Prague, Czechia
-
dc.contributor.affiliation
Czech Technical University in Prague, Czechia
-
dc.contributor.editoraffiliation
Royal Holloway University of London, United Kingdom of Great Britain and Northern Ireland (the)
-
dc.relation.isbn
978-1-57735-880-0
-
dc.relation.issn
2159-5399
-
dc.description.startpage
6262
-
dc.description.endpage
6270
-
dc.type.category
Full-Paper Contribution
-
dc.relation.eissn
2374-3468
-
tuw.booktitle
Proceedings of the 37th AAAI Conference on Artificial Intelligence
-
tuw.container.volume
37, 5
-
tuw.peerreviewed
true
-
tuw.relation.publisher
AAAI Press
-
tuw.relation.publisherplace
Washington DC
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
tuw.publication.orgunit
E192 - Institut für Logic and Computation
-
tuw.publication.orgunit
E192-01 - Forschungsbereich Algorithms and Complexity
-
tuw.publisher.doi
10.1609/aaai.v37i5.25771
-
dc.description.numberOfPages
9
-
tuw.author.orcid
0000-0001-9165-6280
-
tuw.author.orcid
0000-0003-1932-899X
-
tuw.author.orcid
0000-0001-8901-1942
-
tuw.editor.orcid
0000-0001-8108-4899
-
tuw.event.name
Thirty-Seventh AAAI Conference on Artificial Intelligence
en
tuw.event.startdate
07-02-2023
-
tuw.event.enddate
14-02-2023
-
tuw.event.online
On Site
-
tuw.event.type
Event for scientific audience
-
tuw.event.place
Washington DC
-
tuw.event.country
US
-
tuw.event.presenter
Ganian, Robert
-
wb.sciencebranch
Informatik
-
wb.sciencebranch
Mathematik
-
wb.sciencebranch.oefos
1020
-
wb.sciencebranch.oefos
1010
-
wb.sciencebranch.value
80
-
wb.sciencebranch.value
20
-
item.languageiso639-1
en
-
item.openairetype
conference paper
-
item.grantfulltext
none
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_5794
-
crisitem.author.dept
Czech Technical University in Prague
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
-
crisitem.author.dept
Czech Technical University in Prague
-
crisitem.author.dept
Czech Technical University in Prague
-
crisitem.author.dept
Czech Technical University in Prague
-
crisitem.author.dept
E192-01 - Forschungsbereich Algorithms and Complexity
