An incremental version of the \(k\)-center problem on boundary of a convex polygon
From MaRDI portal
Publication:887897
DOI10.1007/S10878-015-9933-3zbMath1333.90106OpenAlexW1097284543MaRDI QIDQ887897
Binhai Zhu, Hai Du, Yin-Feng Xu
Publication date: 3 November 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9933-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Better bounds on online unit clustering
- Base station placement on boundary of a convex polygon
- Better bounds for incremental medians
- Clustering to minimize the maximum intercluster distance
- Performance guarantees for hierarchical clustering
- Clustering to minimize the sum of cluster diameters
- Online clustering with variable sized clusters
- Online sum-radii clustering
- On the competitive ratio for online facility location
- Incremental medians via online bidding
- The 2-Center Problem with Obstacles
- VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
- A general approach for incremental approximation and hierarchical clustering
- The Online Median Problem
- An Incremental Model for Combinatorial Maximization Problems
- Approximation algorithms for hierarchical location problems
This page was built for publication: An incremental version of the \(k\)-center problem on boundary of a convex polygon