scientific article

zbMath1297.68262MaRDI QIDQ2921763

Julia Chuzhoy, Yuval Rabani

Publication date: 13 October 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (max. 100)

Parameterized complexity of categorical clustering with size constraints ⋮ Minimum-cost load-balancing partitions ⋮ Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median ⋮ Approximation algorithms for hard capacitated \(k\)-facility location problems ⋮ An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation ⋮ Approximation algorithms for clustering with dynamic points ⋮ LP-based approximation for uniform capacitated facility location problem ⋮ Centrality of trees for capacitated \(k\)-center ⋮ Improved bounds for metric capacitated covering problems ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An approximation algorithm for soft capacitated \(k\)-facility location problem ⋮ Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median ⋮ Parameterized complexity of categorical clustering with size constraints ⋮ Capacitated domination problem ⋮ Lossy kernelization of same-size clustering ⋮ Unnamed Item ⋮ Approximating $k$-Median via Pseudo-Approximation ⋮ Constant-Factor FPT Approximation for Capacitated k-Median ⋮ Lossy kernelization of same-size clustering

This page was built for publication: