Online clique clustering

DOI10.1007/s00453-019-00625-1zbMath1435.68386arXiv1411.4274OpenAlexW2975614804MaRDI QIDQ2300728

Aleksander Fabijan, Christoph Dürr, Marek Chrobak, Bengt J. Nilsson

Publication date: 28 February 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.4274

zbMATH Keywords

clusteringcompetitive analysisonline algorithmsgraphscliques

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Better bounds for incremental medians
• Correlation clustering
• Approximate clustering of incomplete fingerprints
• Cluster graph modification problems
• Incremental medians via online bidding
• Clustering with qualitative information
• Competitive Strategies for Online Clique Clustering
• ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
• Incremental Clustering and Dynamic Information Retrieval
• Competitive Online Clique Clustering
• A General Approach for Incremental Approximation and Hierarchical Clustering
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Online clique clustering