Competitive strategies for online clique clustering

DOI10.1007/978-3-319-18173-8_7MaRDI QIDQ2947013zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Competitive online clique clustering
• Online clique clustering
• Online correlation clustering
• scientific article; zbMATH DE number 2079869
• Dynamic balanced graph partitioning

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A general approach for incremental approximation and hierarchical clustering
• Better bounds for incremental medians
• Competitive online clique clustering
• Correlation clustering
• Incremental Clustering and Dynamic Information Retrieval
• Incremental medians via online bidding
• ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
• Online correlation clustering

Cited in

(3)

• Lower bounds on paraclique density
• Online clique clustering
• Competitive online clique clustering

This page was built for publication: Competitive strategies for online clique clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947013)