Journal of Combinatorial Optimization

, Volume 35, Issue 2, pp 538–554 | Cite as

The connected disk covering problem

  • Yi Xu
  • Jigen Peng
  • Wencheng Wang
  • Binhai Zhu


Let P be a convex polygon with n vertices. We consider a variation of the K-center problem called the connected disk covering problem (CDCP), i.e., finding K congruent disks centered in P whose union covers P with the smallest possible radius, while a connected graph is generated by the centers of the K disks whose edge length can not exceed the radius. We give a 2.81-approximation algorithm in O(Kn) time.


K-center problem Computational geometry Facility location problem Unit disk graphs 


  1. Brass P, Knauer C, Na HS, Shin CS (2009) Computing k-centers on a line. arXiv preprint arXiv: 0902.3282
  2. Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discrete Math 86:165–177MathSciNetCrossRefMATHGoogle Scholar
  3. Das GK, Das S, Nandy SC, Sinha BP (2006) Efficient algorithm for placing a given number of base stations to cover a convex region. J Parallel Distrib Comput 66(11):1353–1358CrossRefMATHGoogle Scholar
  4. Das GK, Roy S, Das S, Nandy SC (2008) Variations of base station placement problem on the boundary of a convex region. Int J Found Comput Sci 19(2):405–427MathSciNetCrossRefMATHGoogle Scholar
  5. Drezener Z (1984) The P-center problem. Heuristics and optimal algorithms. J Oper Res Soc 35:741–748Google Scholar
  6. Du H, Xu YF (2014) An approximation algorithm for k-center problem on a convex polygon. J Comb Optim 27(3):504–518MathSciNetCrossRefMATHGoogle Scholar
  7. Feder T, Greene D (1988) Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM symposium on theory of computing, pp 434–444Google Scholar
  8. Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293–306MathSciNetCrossRefMATHGoogle Scholar
  9. Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper Res 10(2):180–184MathSciNetCrossRefMATHGoogle Scholar
  10. Huang JH, Wang HL, Chao KM (2016) Computing the line-constrained k-center in the plane for small k. In: Algorithmic aspects in information and management. Springer International Publishing, pp 197–208Google Scholar
  11. Hwang RZ, Lee RCT, Chang RC (1993) The slab dividing approach to solve the euclidean P-center problem. Algorithmica 9:1–22MathSciNetCrossRefMATHGoogle Scholar
  12. Karmakar A, Das S, Nandy SC, Bhattacharya BK (2013) Some variations on constrained minimum enclosing circle problem. J Comb Optim 25(2):176–190MathSciNetCrossRefMATHGoogle Scholar
  13. Megiddo N (1983) Linear-time algorithms for the linear programming in \(R^3\) and related problems. SIAM J Comput 12:759–776MathSciNetCrossRefMATHGoogle Scholar
  14. Megiddo N, Supowit K (1984) On the complexity of some common geometric location problems. SIAM J Comput 13:1182–1196MathSciNetCrossRefMATHGoogle Scholar
  15. Nurmela KJ, Ostergard PRJ (2000) Covering a square with up to 30 equal circles. Research Report HUT-TCS-A62, Laboratory for Theoretical Computer Science, Helsinky University of TechnologyGoogle Scholar
  16. Rezaei M, FazelZarandi MH (2011) Facility location via fuzzy modeling and simulation. Appl Soft Comput 11:5330–5340CrossRefGoogle Scholar
  17. Salhieh A, Weinmann J, Kochha M, Schwiebert L (2001) Power efficient topologies for wireless sensor networks. In: ICPP’2001, pp 156–163Google Scholar
  18. Wu WL, Du HW, Jia XH, Li YS, Huang SCH (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor Comput Sci 352:1–7MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsXi’an Jiaotong UniversityXi’anPeople’s Republic of China
  2. 2.Beijing Center for Mathematics and Information Interdisciplinary SciencesBeijingPeople’s Republic of China
  3. 3.State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingPeople’s Republic of China
  4. 4.Gianforte School of ComputingMontana State UniversityBozemanUSA

Personalised recommendations