Dispersing and grouping points on planar segments
- 1 September 2021
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 886, 169-177
Abstract
No abstract availableKeywords
Funding Information
- Fundamental Research Funds for the Central Universities (skbsh2020-19, 61628207, 72001153)
- National Science Foundation (skbsh2020-19, 61628207, 72001153)
- NSFC (skbsh2020-19, 61628207, 72001153)
This publication has 14 references indexed in Scilit:
- On some matching problems under the color-spanning modelTheoretical Computer Science, 2019
- Dispersing points on intervalsDiscrete Applied Mathematics, 2018
- OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANEInternational Journal of Computational Geometry & Applications, 2012
- On the parameterized complexity of multiple-interval graph problemsTheoretical Computer Science, 2009
- Farthest line segment Voronoi diagramsInformation Processing Letters, 2006
- Approximation Algorithms for Dispersion ProblemsJournal of Algorithms, 2001
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric GraphsJournal of Algorithms, 1998
- Approximation algorithms for maximum dispersionOperations Research Letters, 1997
- The Problem of Compatible RepresentativesSIAM Journal on Discrete Mathematics, 1992
- Unit disk graphsDiscrete Mathematics, 1990