Small Space Stream Summary for Matroid Center

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.20OpenAlexW2977356843MaRDI QIDQ5875472

Sagar Kale

Publication date: 3 February 2023

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

zbMATH Keywords

clusteringmatroidsstreaming algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Approximation Algorithms for Matroid and Knapsack Means Problems ⋮ Fully dynamic clustering and diversity maximization in doubling metrics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid and knapsack center problems
• A streaming algorithm for 2-center with outliers in high dimensions
• Submodular maximization meets streaming: matchings, matroids, and more
• An improved data stream algorithm for clustering
• Clustering to minimize the maximum intercluster distance
• Easy and hard bottleneck location problems
• Robust Hierarchical k-Center Clustering
• Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
• Streaming Algorithms for Submodular Function Maximization
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• Better streaming algorithms for clustering problems
• Budgeted Red-Blue Median and Its Generalizations
• A Best Possible Heuristic for the k-Center Problem
• A Lottery Model for Center-Type Problems with Outliers
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Small Space Stream Summary for Matroid Center