\(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes

DOI10.1007/978-3-030-68211-8_13OpenAlexW3133845396MaRDI QIDQ2232242

Takanori Maehara, Soh Kumabe

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2012.02981

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• 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)
• Achieving anonymity via clustering
• On r-Gatherings on the Line
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• The complexity of satisfiability problems

This page was built for publication: \(r\)-gathering problems on spiders: hardness, FPT algorithms, and PTASes