scientific article; zbMATH DE number 7651201
From MaRDI portal
Publication:5874534
DOI10.4230/LIPIcs.ESA.2020.62MaRDI QIDQ5874534
Tanmay Inamdar, Kasturi R. Varadarajan
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid and knapsack center problems
- On minimum sum of radii and diameters clustering
- On metric clustering to minimize the sum of radii
- Clustering to minimize the maximum intercluster distance
- A constant-factor approximation algorithm for the \(k\)-median problem
- Clustering to minimize the sum of cluster diameters
- LP-Based Algorithms for Capacitated Facility Location
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation
- A Best Possible Heuristic for the k-Center Problem
- The Capacitated K-Center Problem
- Approximating capacitated k-median with (1 + ∊)k open facilities
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- On Uniform Capacitated k -Median Beyond the Natural LP Relaxation
- Constant-Factor FPT Approximation for Capacitated k-Median
- Capacitated Covering Problems in Geometric Spaces
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Parameterized Algorithms
This page was built for publication:
