On r-Gatherings on the Line

DOI10.1007/978-3-319-19647-3_3zbMath1408.90157OpenAlexW3024879097MaRDI QIDQ3452549

Toshihiro Akagi, Shin-ichi Nakano

Publication date: 12 November 2015

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19647-3_3

zbMATH Keywords

algorithmfacility locationgathering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Discrete location and assignment (90B80)

Related Items (6)

A linear time algorithm for the \(r\)-gathering problem on the line ⋮ r-Gatherings on a star and uncertain r-gatherings on a line ⋮ \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes ⋮ Online facility assignment ⋮ A Simple Algorithm for $r$-gatherings on the Line ⋮ The fast algorithm for online \(k\)-server problem on trees

Cites Work

• On min-max \(r\)-gatherings
• Achieving anonymity via clustering
• A Randomized Algorithm for Weighted Approximation of Points by a Step Function
• Generalized Selection and Ranking: Sorted Matrices
• Fitting a Step Function to a Point Set

This page was built for publication: On r-Gatherings on the Line