Clustering with lower-bounded sizes. A general graph-theoretic framework
type: Item
instance of: scholarly article
title: Clustering with lower-bounded sizes. A general graph-theoretic framework
zbMATH Open document ID: 1391.68043
author: Faisal N. Abu-Khzam
author: Cristina Bazgan
author: Katrin Casel
author: Henning Fernau
published in: Algorithmica
publication date: 2018-07-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6911198
zbMATH Keywords: clustering
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation algorithms
zbMATH Keywords: anonymisation
MaRDI profile type: Publication
full work available at URL: s00453-017-0374-5
OpenAlex ID: W2756184550
cites work: Q4636485
cites work: Achieving anonymity via clustering
cites work: Terminal Backup, 3D Matching, and Covering Cubic Graphs
cites work: On min-max \(r\)-gatherings
cites work: Resolving the Complexity of Some Data Privacy Problems
cites work: Packing subgraphs in a graph
cites work: Matching, Euler tours and the Chinese postman
cites work: Fast approximate PCPs
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: A Faster Deterministic Maximum Flow Algorithm
cites work: Max flows in O(nm) time, or better
cites work: Optimization, approximation, and complexity classes
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Efficient algorithms for the 2-gathering problem
cites work: A simplified NP-complete satisfiability problem
Wikidata QID: Q59864855
DOI: 10.1007/S00453-017-0374-5
description: scientific article; zbMATH DE number 6911198