r-Gatherings on a star and uncertain r-gatherings on a line

DOI10.1142/S1793830921501603OpenAlexW3176198025MaRDI QIDQ5101887

Md. Saidur Rahman, Shareef Ahmed, Shin-ichi Nakano

Publication date: 2 September 2022

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921501603

zbMATH Keywords

clusteringfacility location problem\(r\)-gathering problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Closest pair and the post office problem for stochastic points
• One-dimensional \(k\)-center on uncertain data
• On min-max \(r\)-gatherings
• A simple algorithm for r-gatherings on the line
• \(r\)-gatherings on a star
• A linear time algorithm for the \(r\)-gathering problem on the line (extended abstract)
• Convex hulls under uncertainty
• Nearest-neighbor searching under uncertainty. I
• Achieving anonymity via clustering
• On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
• On r-Gatherings on the Line

This page was built for publication: r-Gatherings on a star and uncertain r-gatherings on a line