scientific article; zbMATH DE number 7561535
From MaRDI portal
Publication:5091192
DOI10.4230/LIPIcs.ICALP.2019.42MaRDI QIDQ5091192
Anupam Gupta, Amit Kumar, Vincent Cohen-Addad, Euiwoong Lee, Jason Li
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.12334
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Improved parameterized approximation for balanced \(k\)-median ⋮ Tight FPT approximation for socially fair clustering ⋮ Approximation schemes for \(k\)-facility location ⋮ A unified framework of FPT approximation algorithms for clustering problems ⋮ FPT Approximation for Constrained Metric k-Median/Means ⋮ Lossy kernelization of same-size clustering ⋮ Unnamed Item ⋮ Lossy kernelization of same-size clustering ⋮ On parameterized approximation algorithms for balanced clustering ⋮ To close is easier than to open: dual parameterization to \(k\)-median
Cites Work
- Unnamed Item
- Unnamed Item
- Improved and simplified inapproximability for \(k\)-means
- A local search approximation algorithm for \(k\)-means clustering
- Small space representations for metric min-sum \(k\)-clustering and their applications
- A constant-factor approximation algorithm for the \(k\)-median problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Approximating $k$-Median via Pseudo-Approximation
- A threshold of ln n for approximating set cover
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Linear-time approximation schemes for clustering problems in any dimensions
- On k-Median clustering in high dimensions
- Greedy Strikes Back: Improved Facility Location Algorithms
- A Parallel Repetition Theorem
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More
- On the parameterized complexity of approximating dominating set
- Facility Location with Matroid or Knapsack Constraints
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- The Parameterized Complexity of k-B<scp>iclique</scp>
- A unified framework for approximating and clustering data
- Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
This page was built for publication:
