A linear time algorithm for the r-gathering problem on the line

DOI10.1016/J.TCS.2021.03.015MaRDI QIDQ2662686zbMATH OpenOpenAlexFDO

Authors Anik Sarker, Wing-Kin Sung, M. Sohel Rahman

Publication date 14 April 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.03.015

zbMATH Keywords

\(r\)-gathering problemalgorithmsfacility location problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Recommendations

• A linear time algorithm for the \(r\)-gathering problem on the line (extended abstract)
• A simple algorithm for r-gatherings on the line
• A simple algorithm for \(r\)-gatherings on the line
• On r-gatherings on the line
• On min-max \(r\)-gatherings

Cites work

• A simple algorithm for r-gatherings on the line
• Achieving anonymity via clustering
• Algorithms for two bottleneck optimization problems
• On r-gatherings on the line
• On min-max \(r\)-gatherings

Cited in

(7)

• 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)
• On r-gatherings on the line
• Efficient algorithms for the 2-gathering problem
• A simple algorithm for \(r\)-gatherings on the line
• One-dimensional \(r\)-gathering under uncertainty

This page was built for publication: A linear time algorithm for the \(r\)-gathering problem on the line

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