Small Space Stream Summary for Matroid Center

DOI10.4230/LIPICS.APPROX-RANDOM.2019.20MaRDI QIDQ5875472zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A lottery model for center-type problems with outliers
• A streaming algorithm for 2-center with outliers in high dimensions
• Algorithms for facility location problems with outliers. (Extended abstract)
• An improved data stream algorithm for clustering
• Better streaming algorithms for clustering problems
• Budgeted red-blue median and its generalizations
• Buyback problem -- approximate matroid intersection with cancellation costs
• Clustering to minimize the maximum intercluster distance
• Easy and hard bottleneck location problems
• Generalized center problems with outliers
• scientific article; zbMATH DE number 1559578 (Why is no real title available?)
• scientific article; zbMATH DE number 6820208 (Why is no real title available?)
• 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
• Robust hierarchical k-center clustering
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• Streaming algorithms for submodular function maximization
• The matroid median problem
• The non-uniform k-center problem

Cited in

(2)

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

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

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