Dispersing and grouping points on planar segments

DOI10.1016/j.tcs.2021.08.011OpenAlexW3194523972MaRDI QIDQ2232600

Binhai Zhu, Peng Zou, Xiaozhou He, Wenfeng Lai

Publication date: 6 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.08.011

zbMATH Keywords

dispersion problemNP-hardnessgeometric optimizationFPTManhattan distance

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Farthest line segment Voronoi diagrams
• On the parameterized complexity of multiple-interval graph problems
• A study on two geometric location problems
• Unit disk graphs
• Approximation algorithms for maximum dispersion
• Dispersing points on intervals
• Minimum diameter color-spanning sets revisited
• On some matching problems under the color-spanning model
• Approximation Algorithms for Dispersion Problems
• ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM
• The Problem of Compatible Representatives
• Heuristic and Special Case Algorithms for Dispersion Problems
• NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
• Local Search for Max-Sum Diversification
• Dispersing Points on Intervals
• Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
• OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE
• Algorithms – ESA 2005

This page was built for publication: Dispersing and grouping points on planar segments