Parameterized dynamic cluster editing
dc.contributor.author | Luo, Junjie | |
dc.contributor.author | Molter, Hendrik | |
dc.contributor.author | Nichterlein, André | |
dc.contributor.author | Niedermeier, Rolf | |
dc.date.accessioned | 2021-03-15T11:15:22Z | |
dc.date.available | 2021-03-15T11:15:22Z | |
dc.date.issued | 2020-07-25 | |
dc.description.abstract | We introduce a dynamic version of the NP -hard graph modification problem Cluster Editing . The essential point here is to take into account dynamically evolving input graphs: having a cluster graph (that is, a disjoint union of cliques) constituting a solution for a first input graph, can we cost-efficiently transform it into a “similar” cluster graph that is a solution for a second (“subsequent”) input graph? This model is motivated by several application scenarios, including incremental clustering, the search for compromise clusterings, or also local search in graph-based data clustering. We thoroughly study six problem variants (three modification scenarios edge editing, edge deletion, edge insertion; each combined with two distance measures between cluster graphs). We obtain both fixed-parameter tractability as well as (parameterized) hardness results, thus (except for three open questions) providing a fairly complete picture of the parameterized computational complexity landscape under the two perhaps most natural parameterizations: the distances of the new “similar” cluster graph to (1) the second input graph and to (2) the input cluster graph. | en |
dc.description.sponsorship | TU Berlin, Open-Access-Mittel – 2020 | en |
dc.description.sponsorship | DFG, 284041127, Algorithmen für Faire Allokationen (AFFA) | en |
dc.description.sponsorship | DFG, 382063982, Multivariate Algorithmik temporaler Graphprobleme (MATE) | en |
dc.identifier.eissn | 1432-0541 | |
dc.identifier.issn | 0178-4617 | |
dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/12837 | |
dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-11637 | |
dc.language.iso | en | |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | |
dc.subject.ddc | 004 Datenverarbeitung; Informatik | en |
dc.subject.other | compromise clustering | en |
dc.subject.other | correlation clustering | en |
dc.subject.other | fixed-parameter tractability | en |
dc.subject.other | goal-oriented clustering | en |
dc.subject.other | graph-based data clustering | en |
dc.subject.other | kernelization | en |
dc.subject.other | local search | en |
dc.subject.other | multi-choice knapsack | en |
dc.subject.other | NP-hard problems | en |
dc.subject.other | parameterized complexity | en |
dc.title | Parameterized dynamic cluster editing | en |
dc.type | Article | en |
dc.type.version | publishedVersion | en |
dcterms.bibliographicCitation.doi | 10.1007/s00453-020-00746-y | en |
dcterms.bibliographicCitation.journaltitle | Algorithmica | en |
dcterms.bibliographicCitation.originalpublishername | SpringerNature | en |
dcterms.bibliographicCitation.originalpublisherplace | London [u.a.] | en |
dcterms.bibliographicCitation.pageend | 44 | en |
dcterms.bibliographicCitation.pagestart | 1 | en |
dcterms.bibliographicCitation.volume | 83 | en |
tub.accessrights.dnb | free | en |
tub.affiliation | Fak. 4 Elektrotechnik und Informatik::Inst. Softwaretechnik und Theoretische Informatik::FG Algorithmik und Komplexitätstheorie | de |
tub.affiliation.faculty | Fak. 4 Elektrotechnik und Informatik | de |
tub.affiliation.group | FG Algorithmik und Komplexitätstheorie | de |
tub.affiliation.institute | Inst. Softwaretechnik und Theoretische Informatik | de |
tub.publisher.universityorinstitution | Technische Universität Berlin | en |
Files
Original bundle
1 - 1 of 1
Loading…
- Name:
- Luo_etal_Parameterized_2021.pdf
- Size:
- 6.01 MB
- Format:
- Adobe Portable Document Format