Clustering with or without the approximation
From MaRDI portal
Publication:2377383
DOI10.1007/s10878-011-9382-6zbMath1271.90072OpenAlexW2089472739MaRDI QIDQ2377383
Michael Yu, Frans Schalekamp, Anke van Zuylen
Publication date: 28 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9382-6
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Center-based clustering under perturbation stability
- A note on solving large p-median problems
- A constant-factor approximation algorithm for the \(k\)-median problem
- A threshold of ln n for approximating set cover
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Agnostic Clustering
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Local Search Heuristics for k-Median and Facility Location Problems
- Least squares quantization in PCM
- Improved Combinatorial Algorithms for Facility Location Problems
This page was built for publication: Clustering with or without the approximation