Diameter and k-Center in Sliding Windows

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Colloquium on Automata, Languages and Programming

• Publication date

  2016-08-17

• Fields of study

  Mathematics, Physics, Computer Science

• Identifiers
  DOI 10.4230/LIPIcs.ICALP.2016.19
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Clustering Problems on Sliding Windows

  2016cited by this paper
• Clustering on Sliding Windows in Polylogarithmic Space

  2015cited by this paper
• An Improved Data Stream Algorithm for Clustering

  2014cited by this paper
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions

  2011cited by this paper
• Streaming Algorithms for Extent Problems in High Dimensions

  2010cited by this paper
• Effective Computations on Sliding Windows

  2010cited by this paper
• Tight results for clustering and summarizing data streams

  2009cited by this paper
• Core-Preserving Algorithms

  2008cited by this paper
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity

  2008cited by this paper
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions

  2008cited by this paper
• Geometric Optimization Problems over Sliding Windows

  2004cited by this paper
• Maintaining variance and k-medians over data stream windows

  2003cited by this paper
• Better algorithms for high-dimensional proximity problems via asymmetric embeddings

  2003cited by this paper
• Better streaming algorithms for clustering problems

  2003cited by this paper
• Computing Diameter in the Streaming and Sliding-Window Models

  2002cited by this paper
• Maintaining Stream Statistics over Sliding Windows

  2002cited by this paper
• Incremental clustering and dynamic information retrieval

  1997cited by this paper
• Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions

  1991cited by this paper
• A unified approach to approximation algorithms for bottleneck problems

  1986cited by this paper
• Clustering to Minimize the Maximum Intercluster Distance

  1985cited by this paper

• Fair Center Clustering in Sliding Windows

  2025cites this paper
• Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond

  2025cites this paper
• The General Expiration Streaming Model: Diameter, k-Center, Counting, Sampling, and Friends

  2025influential citation
• Fully Dynamic k-Center Clustering with Outliers

  2023cites this paper
• Moderate Dimension Reduction for k-Center Clustering

  2023cites this paper
• Near-Optimal k-Clustering in the Sliding Window Model

  2023cites this paper
• Fair $k$-Center Problem with Outliers on Massive Data

  2023cites this paper
• Fully Dynamic Consistent k-Center Clustering

  2023cites this paper
• k-Center Clustering with Outliers in the MPC and Streaming Model

  2023cites this paper
• Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics

  2023cites this paper
• k-Center Clustering with Outliers in Sliding Windows

  2022influential citation
• Adaptive k-center and diameter estimation in sliding windows

  2022influential citation
• Optimal Fully Dynamic k-Centers Clustering

  2021cites this paper
• Group Formation in Shared Spaces

  2021cites this paper
• k-Center Clustering with Outliers in the Sliding-Window Model

  2021cites this paper
• Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches

  2021cites this paper
• Computing Euclidean k-Center over Sliding Windows

  2020influential citation
• Dimensionality-adaptive k-center in sliding windows

  2020influential citation
• Sliding Window Algorithms for k-Clustering Problems

  2020cites this paper
• Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives

  2019cites this paper
• New Algorithms for Large Datasets and Distributions

  2019cites this paper
• Fully Dynamic k-Center Clustering in Doubling Metrics

  2019cites this paper
• Fully dynamic hierarchical diameter k-clustering and k-center

  2019cites this paper
• New Algorithms for Distributed Sliding Windows

  2018cites this paper
• Small Space Stream Summary for Matroid Center

  2018cites this paper
• Fully Dynamic k-Center Clustering

  2018influential citation