A linear time algorithm for the \(r\)-gathering problem on the line (extended abstract)

DOI10.1007/978-3-030-10564-8_5zbMath1434.90083OpenAlexW2906323786MaRDI QIDQ2327522

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

Publication date: 15 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-10564-8_5

Mathematics Subject Classification ID

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

Related Items (3)

r-Gatherings on a star and uncertain r-gatherings on a line ⋮ \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes ⋮ A Simple Algorithm for $r$-gatherings on the Line

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