Algorithms for minimizing the movements of spreading points in linear domains

DOI10.57717/CGT.V4I1.21MaRDI QIDQ6913065zbMATH OpenFDO

Authors Shimin Li, Haitao Wang

Publication date 21 October 2025

Published in CGT. Computing in Geometry and Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.57717/CGT.V4I1.21

zbMATH Keywords

dispersion problemfacility locationlinear-time algorithmspoints spreading

Mathematics Subject Classification ID

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

Cites work

• A new polynomial-time algorithm for linear programming
• A study on two geometric location problems
• Approximation algorithms for dispersion problems
• Approximation algorithms for spreading points
• Constrained \(k\)-center and movement to independence
• Dispersion in disks
• Heuristic and Special Case Algorithms for Dispersion Problems
• Minimizing movement
• Minimizing movement in mobile facility location problems
• Polynomial algorithms in linear programming
• Systems of distant representatives

This page was built for publication: Algorithms for minimizing the movements of spreading points in linear domains

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