scientific article; zbMATH DE number 7375957

DOI10.4230/LIPIcs.ICALP.2018.30zbMath1499.68400MaRDI QIDQ5002700

Maryam Negahbani, Deeparnab Chakrabarty

Publication date: 28 July 2021

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

zbMATH Keywords

clusteringapproximation algorithms\(k\)-center problem

Mathematics Subject Classification ID

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

Related Items (3)

Small Space Stream Summary for Matroid Center ⋮ Unnamed Item ⋮ Robust \(k\)-center with two types of radii

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matroid and knapsack center problems
• New approaches to multi-objective optimization
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Clustering to minimize the maximum intercluster distance
• Easy and hard bottleneck location problems
• The heterogeneous capacitated \(k\)-center problem
• Achieving anonymity via clustering
• A Best Possible Heuristic for the k-Center Problem
• The complexity of restricted spanning tree problems
• Random pseudo-polynomial algorithms for exact matroid problems
• A Lottery Model for Center-Type Problems with Outliers
• On Uniform Capacitated k-Median Beyond the Natural LP Relaxation
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: