Dispersion problem on a convex polygon

DOI10.1016/J.IPL.2024.106498MaRDI QIDQ6602315zbMATH OpenFDO

Authors Pawan Kumar Mishra, S. V. Rao, Gautam K. Das

Publication date 11 September 2024

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2024.106498

zbMATH Keywords

approximation algorithmsconvex polygondispersion problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80)

Recommendations

• Exact algorithms for the max-min dispersion problem
• Max-Min 3-Dispersion problems
• Max-min dispersion on a line
• Approximation of geometric dispersion problems
• Max-min dispersion on a line

Cites work

• A study on two geometric location problems
• Exact algorithms for the max-min dispersion problem
• Heuristic and Special Case Algorithms for Dispersion Problems
• scientific article; zbMATH DE number 432817 (Why is no real title available?)
• Obnoxious Facility Location on Graphs
• Polynomially bounded algorithms for locatingp-centers on a tree
• The discrete p-dispersion problem

Cited in

(1)

• Algorithms for k-dispersion for points in convex position in the plane

This page was built for publication: Dispersion problem on a convex polygon

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