Packing circles in circles and applications

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Packing circles in a circle is a classic mathematical problem, which has been studied for a long time. Recently, this problem received a great deal of applications in the study of wireless networks. Those applications are related to many combinatorial optimization problems raised in wireless networks. In analyzing approximation algorithms for those combinatorial optimization problems, it is required to establish an upper bound for the number of untouched unit circles which can be packed into a circle of radius r, where a unit circle is a circle with diameter one. This bound can be easily derived from some classic bounds for the number of unit circles packed into a circle. Moreover, analysis of those approximation algorithms also promoted some new problems about packing circles in circles. In this chapter, a state of the art on the developments in this research direction is presented.

Author supplied keywords

Cite

CITATION STYLE

APA

Zhang, Z., Wu, W., Ding, L., Liu, Q., & Wu, L. (2013). Packing circles in circles and applications. In Handbook of Combinatorial Optimization (Vol. 4–5, pp. 2549–2584). Springer New York. https://doi.org/10.1007/978-1-4419-7997-1_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free