Clustering with lower-bounded sizes. A general graph-theoretic framework

DOI10.1007/s00453-017-0374-5zbMath1391.68043OpenAlexW2756184550WikidataQ59864855 ScholiaQ59864855MaRDI QIDQ722539

Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau

Publication date: 26 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-017-0374-5

zbMATH Keywords

computational complexityclusteringapproximation algorithmsanonymisation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)

Related Items (1)

Unnamed Item

Cites Work

• On min-max \(r\)-gatherings
• A simplified NP-complete satisfiability problem
• Packing subgraphs in a graph
• Optimization, approximation, and complexity classes
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Fast approximate PCPs
• Efficient algorithms for the 2-gathering problem
• Achieving anonymity via clustering
• Terminal Backup, 3D Matching, and Covering Cubic Graphs
• Resolving the Complexity of Some Data Privacy Problems
• A Faster Deterministic Maximum Flow Algorithm
• Matching, Euler tours and the Chinese postman
• A General Approximation Technique for Constrained Forest Problems
• Max flows in O(nm) time, or better
• Unnamed Item

This page was built for publication: Clustering with lower-bounded sizes. A general graph-theoretic framework