Skip to main content
Springer Nature Link
Log in

The connected disk covering problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Brass P, Knauer C, Na HS, Shin CS (2009) Computing k-centers on a line. arXiv preprint arXiv: 0902.3282

  • Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discrete Math 86:165–177

    Article  MathSciNet  MATH  Google Scholar 

  • 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–1358

    Article  MATH  Google Scholar 

  • 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–427

    Article  MathSciNet  MATH  Google Scholar 

  • Drezener Z (1984) The P-center problem. Heuristics and optimal algorithms. J Oper Res Soc 35:741–748

    Google Scholar 

  • Du H, Xu YF (2014) An approximation algorithm for k-center problem on a convex polygon. J Comb Optim 27(3):504–518

    Article  MathSciNet  MATH  Google Scholar 

  • Feder T, Greene D (1988) Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM symposium on theory of computing, pp 434–444

  • Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293–306

    Article  MathSciNet  MATH  Google Scholar 

  • Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper Res 10(2):180–184

    Article  MathSciNet  MATH  Google Scholar 

  • 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–208

  • Hwang RZ, Lee RCT, Chang RC (1993) The slab dividing approach to solve the euclidean P-center problem. Algorithmica 9:1–22

    Article  MathSciNet  MATH  Google Scholar 

  • Karmakar A, Das S, Nandy SC, Bhattacharya BK (2013) Some variations on constrained minimum enclosing circle problem. J Comb Optim 25(2):176–190

    Article  MathSciNet  MATH  Google Scholar 

  • Megiddo N (1983) Linear-time algorithms for the linear programming in \(R^3\) and related problems. SIAM J Comput 12:759–776

    Article  MathSciNet  MATH  Google Scholar 

  • Megiddo N, Supowit K (1984) On the complexity of some common geometric location problems. SIAM J Comput 13:1182–1196

    Article  MathSciNet  MATH  Google Scholar 

  • 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 Technology

  • Rezaei M, FazelZarandi MH (2011) Facility location via fuzzy modeling and simulation. Appl Soft Comput 11:5330–5340

    Article  Google Scholar 

  • Salhieh A, Weinmann J, Kochha M, Schwiebert L (2001) Power efficient topologies for wireless sensor networks. In: ICPP’2001, pp 156–163

  • 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–7

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, 710049, People’s Republic of China

    Yi Xu & Jigen Peng

  2. Beijing Center for Mathematics and Information Interdisciplinary Sciences, Beijing, 100048, People’s Republic of China

    Jigen Peng

  3. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100080, People’s Republic of China

    Wencheng Wang

  4. Gianforte School of Computing, Montana State University, Bozeman, MT, 59717, USA

    Binhai Zhu

Authors
  1. Yi Xu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Jigen Peng
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Wencheng Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Binhai Zhu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yi Xu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, Y., Peng, J., Wang, W. et al. The connected disk covering problem. J Comb Optim 35, 538–554 (2018). https://doi.org/10.1007/s10878-017-0195-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0195-0

Keywords