Using patterns to form homogeneous teams

DOI10.1007/s00453-013-9821-0zbMath1322.90074OpenAlexW2012218721MaRDI QIDQ2346970

André Nichterlein, Geevarghese Philip, Robert Bredereck, Thomas Köhler, Rolf Niedermeier

Publication date: 26 May 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9821-0

zbMATH Keywords

NP-hardnessfixed-parameter tractabilityteam selectionparameterized complexitykernelization\(k\)-anonymityteam formationmatrix modification problems

Mathematics Subject Classification ID

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

Related Items

Pattern-guided \(k\)-anonymity, Separating sets of strings by finding matching patterns is almost always hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernel bounds for disjoint cycles and disjoint paths
• Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
• The effect of homogeneity on the computational complexity of combinatorial data anonymization
• Parametrized complexity theory.
• Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n
• Kernelization – Preprocessing with a Guarantee
• Achieving anonymity via clustering
• Reflections on Multivariate Algorithmics and Problem Parameterization
• Resolving the Complexity of Some Data Privacy Problems
• PROJECT TEAM SELECTION USING FUZZY OPTIMIZATION APPROACH
• Kernelization: New Upper and Lower Bound Techniques
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Pattern-Guided k-Anonymity