scientific article; zbMATH DE number 7376023
From MaRDI portal
Publication:5002778
DOI10.4230/LIPICS.ICALP.2018.96zbMath1499.90117arXiv1802.02497MaRDI QIDQ5002778
Clemens Rösner, Melanie Schmidt
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1802.02497
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (12)
A Technique for Obtaining True Approximations for k-Center with Covering Constraints ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Efficient algorithms for fair clustering with a new notion of fairness ⋮ Attraction-repulsion clustering: a way of promoting diversity linked to demographic parity in fair clustering ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Making clusterings fairer by post-processing: algorithms, complexity results and experiments ⋮ Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier ⋮ On the cost of essentially fair clusterings ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Faster balanced clusterings in high dimension ⋮ Algorithms for fair \(k\)-clustering with multiple protected attributes ⋮ A technique for obtaining true approximations for \(k\)-center with covering constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid and knapsack center problems
- A 3-approximation algorithm for the facility location problem with uniform capacities
- Centrality of trees for capacitated \(k\)-center
- Clustering to minimize the maximum intercluster distance
- Easy and hard bottleneck location problems
- Fault tolerant \(K\)-center problems
- A constant-factor approximation algorithm for the \(k\)-median problem
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Capacitated center problems with two-sided bounds and outliers
- Approximating $k$-Median via Pseudo-Approximation
- A 5-Approximation for Capacitated Facility Location
- Achieving anonymity via clustering
- Constant Factor Approximation for Capacitated k-Center with Outliers
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A new greedy approach for facility location problems
- Clustering with Diversity
- Greedy Strikes Back: Improved Facility Location Algorithms
- How to Allocate Network Centers
- The Capacitated K-Center Problem
- Analysis of a Local Search Heuristic for Facility Location Problems
- Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
- Local Search Heuristics for k-Median and Facility Location Problems
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- A Unified Framework for Clustering Constrained Data without Locality Property
- Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
This page was built for publication:
