Dispersing and grouping points on planar segments
From MaRDI portal
Publication:2232600
DOI10.1016/J.TCS.2021.08.011OpenAlexW3194523972MaRDI QIDQ2232600FDOQ2232600
Authors: Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou 
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
Recommendations
- Dispersing points on intervals
- Dispersing points on intervals
- Partitioning point sets in arbitrary dimension
- Partitioning point sets in space into disjoint convex polytopes
- Partitioning points by parallel planes
- scientific article; zbMATH DE number 3407703
- Separating point sets in polygonal environments
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Partitioning a planar point set into empty convex polygons
Cites Work
- Unit disk graphs
- On the farthest line-segment Voronoi diagram
- The Problem of Compatible Representatives
- Farthest line segment Voronoi diagrams
- On the parameterized complexity of multiple-interval graph problems
- Heuristic and Special Case Algorithms for Dispersion Problems
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- A study on two geometric location problems
- Algorithms – ESA 2005
- Optimal binary space partitions for segments in the plane
- Approximation algorithms for maximum dispersion
- Approximation algorithms for dispersion problems
- Dispersing points on intervals
- On some matching problems under the color-spanning model
- Minimum diameter color-spanning sets revisited
- Local Search for Max-Sum Diversification
- Title not available (Why is that?)
- Dispersing points on intervals
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
Cited In (2)
This page was built for publication: Dispersing and grouping points on planar segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232600)
