Competitive Strategies for Online Clique Clustering

DOI10.1007/978-3-319-18173-8_7zbMath1435.68387OpenAlexW2120085999MaRDI QIDQ2947013

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

Publication date: 21 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2043/19851

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)

Related Items (1)

Online clique clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Better bounds for incremental medians
• Correlation clustering
• Incremental medians via online bidding
• 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

This page was built for publication: Competitive Strategies for Online Clique Clustering