Algorithms for \(k\)-dispersion for points in convex position in the plane

DOI10.1007/978-3-031-25211-2_5OpenAlexW4318023008MaRDI QIDQ6174438

Manjanna Basappa, Joseph S. B. Mitchell, Vishwanath R. Singireddy

Publication date: 17 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_5

zbMATH Keywords

dynamic programmingDelaunay triangulationfixed parameter tractableobnoxious facility locationmax-min dispersion

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact algorithms for the max-min dispersion problem
• The discrete p-dispersion problem
• A study on two geometric location problems
• On the multimodality of distances in convex polygons
• Maximum dispersion and geometric maximum weight cliques
• Max-Min 3-Dispersion problems
• Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
• Heuristic and Special Case Algorithms for Dispersion Problems
• Max-min dispersion on a line
• Approximation of geometric dispersion problems

This page was built for publication: Algorithms for \(k\)-dispersion for points in convex position in the plane