An incremental version of the k-center problem on boundary of a convex polygon

DOI10.1007/S10878-015-9933-3MaRDI QIDQ887897zbMATH OpenOpenAlexFDO

Authors Hai Du, Binhai Zhu, Yinfeng 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

zbMATH Keywords

\(k\)-centercompetitive ratiofacility locationincremental algorithm

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• An approximation algorithm for k-center problem on a convex polygon
• Incremental facility location problem and its competitive algorithms
• Constrained k-center problem on a convex polygon
• Better Bounds for Incremental Medians
• An approximation algorithm for the Euclidean incremental median problem

Cites work

• A general approach for incremental approximation and hierarchical clustering
• An Incremental Model for Combinatorial Maximization Problems
• Approximation algorithms for hierarchical location problems
• Base station placement on boundary of a convex polygon
• Better bounds for incremental medians
• Better bounds on online unit clustering
• Clustering to minimize the maximum intercluster distance
• Clustering to minimize the sum of cluster diameters
• scientific article; zbMATH DE number 1559578 (Why is no real title available?)
• Incremental medians via online bidding
• On the competitive ratio for online facility location
• Online clustering with variable sized clusters
• Online sum-radii clustering
• Performance guarantees for hierarchical clustering
• Some constrained minimax and maximin location problems
• The 2-center problem with obstacles
• The Online Median Problem
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION

Cited in

(3)

• An approximation algorithm for k-center problem on a convex polygon
• Distance domination in graphs
• Constrained k-center problem on a convex polygon

This page was built for publication: An incremental version of the \(k\)-center problem on boundary of a convex polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887897)