scientific article; zbMATH DE number 6820208

DOI10.4230/LIPICS.ICALP.2016.19MaRDI QIDQ4598152zbMATH OpenFDO

Authors Vincent Cohen-Addad, Chris Schwiegelshohn, Christian Sohler

Publication date 19 December 2017

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2016.19

zbMATH Keywords

sliding windowsdiameter\(k\)-centerstreaming

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 823178
• Computing diameter in the streaming and sliding-window models
• Nearly optimal distinct elements and heavy hitters on sliding windows
• scientific article; zbMATH DE number 2119682
• Generalized \(k\)-center: distinguishing doubling and highway dimension
• Center and its spectrum of almost all n-vertex graphs of given diameter
• scientific article; zbMATH DE number 7278055
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center
• On the diameter of Kneser graphs
• A note on diameters of point sets

Cited in

(11)

• GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS
• Fully dynamic \(k\)-center clustering with outliers
• Fully dynamic clustering and diversity maximization in doubling metrics
• Small Space Stream Summary for Matroid Center
• Computing diameter in the streaming and sliding-window models
• Fully dynamic \(k\)-center clustering with outliers
• Clustering problems on sliding windows
• Algorithms for \(k\)-median clustering over distributed streams
• New algorithms for distributed sliding windows
• Algorithms and Computation
• Moderate dimension reduction for k-center clustering

This page was built for publication:

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