Max–min dispersion on a line
- 25 February 2020
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 44 (3) , 1824-1830
Abstract
No abstract availableKeywords
Funding Information
- KAKENHI (17K00003)
This publication has 15 references indexed in Scilit:
- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPsAlgorithmica, 2007
- Maximum Dispersion and Geometric Maximum Weight CliquesAlgorithmica, 2003
- Approximation Algorithms for Dispersion ProblemsJournal of Algorithms, 2001
- Efficient algorithms for geometric optimizationACM Computing Surveys, 1998
- Approximation of geometric dispersion problemsLecture Notes in Computer Science, 1998
- Approximation algorithms for maximum dispersionOperations Research Letters, 1997
- Optimal algorithms for circle partitioning1997
- Heuristic and Special Case Algorithms for Dispersion ProblemsOperations Research, 1994
- The discrete p-dispersion problemEuropean Journal of Operational Research, 1990
- A study on two geometric location problemsInformation Processing Letters, 1988