scientific article; zbMATH DE number 6820256
From MaRDI portal
Publication:4598206
DOI10.4230/LIPIcs.ICALP.2016.67zbMath1388.68303arXiv1605.03692MaRDI QIDQ4598206
Ravishankar Krishnaswamy, Prachi Goyal, Deeparnab Chakrabarty
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1605.03692
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (25)
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ A Technique for Obtaining True Approximations for k-Center with Covering Constraints ⋮ Fair Colorful k-Center Clustering ⋮ Approximation algorithms for clustering with dynamic points ⋮ A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks ⋮ On some variants of Euclidean \(k\)-supplier ⋮ Generalized \(k\)-center: distinguishing doubling and highway dimension ⋮ How to find a good explanation for clustering? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The k-centre problem for classes of cyclic words ⋮ Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Small Space Stream Summary for Matroid Center ⋮ A Lottery Model for Center-Type Problems with Outliers ⋮ A weighted K-member clustering algorithm for K-anonymization ⋮ Unnamed Item ⋮ Robust \(k\)-center with two types of radii ⋮ Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction ⋮ A Lottery Model for Center-Type Problems With Outliers ⋮ Generalized Center Problems with Outliers ⋮ A technique for obtaining true approximations for \(k\)-center with covering constraints ⋮ Fair colorful \(k\)-center clustering
This page was built for publication:
