相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。A scalable exact algorithm for the vertex p-center problem
Claudio Contardo et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
Daniel Aloise et al.
JOURNAL OF GLOBAL OPTIMIZATION (2018)
The Continuous-Time Service Network Design Problem
Natashia Boland et al.
OPERATIONS RESEARCH (2017)
Approximation algorithms for the unit disk cover problem in 2D and 3D
Ahmad Biniaz et al.
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS (2017)
Unit disk cover problem in 2D
Manjanna Basappa et al.
JOURNAL OF DISCRETE ALGORITHMS (2015)
Exact algorithms and APX-hardness results for geometric packing and covering problems
Timothy M. Chan et al.
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS (2014)
ON THE DISCRETE UNIT DISK COVER PROBLEM
Gautam K. Das et al.
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS (2012)
The Complexity of the Minimum Sensor Cover Problem with Unit-Disk Sensing Regions over a Connected Monitored Region
Ren-Song Ko
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS (2012)
Improved Results on Geometric Hitting Set Problems
Nabil H. Mustafa et al.
DISCRETE & COMPUTATIONAL GEOMETRY (2010)
AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
Francisco Claude et al.
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS (2010)
分享论文
