Abstract
We discuss Peter Buneman’s suggestion that a fibre connection to the internet — a hub — should be available within every circle enclosing a population of at least 2,000 people (a b-circle). This poses the problem of finding a small set, H, of hubs, such that every b-circle contains a hub. We show that a greedy algorithm does not lead to an optimal set of hubs. Instead it models market forces, which are naturally greedy. An unfettered market will exploit the most profitable communities and, just like a greedy algorithm, leave gaps that it is uneconomic to fill. We describe a geometric heuristic for the discovery of efficient hub placements satisfying a purely combinatorial analogue of Buneman’s criterion, and apply it to illustrate the inherent inefficiency of gap-funding in a market-led broadband policy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernardi, G., Buneman, P., Marina, M.K.: Tegola tiered mesh network testbed in rural Scotland. In: WiNS-DR 2008: Proceedings of the 2008 ACM Workshop on Wireless Networks and Systems for Developing Regions, pp. 9–16. ACM (September 2008), http://dl.acm.org/citation.cfm?id=1410067
Clark, P.J., Evans, F.C.: Distance to nearest neighbor as a measure of spatial relationships in populations. Ecology 35(4), 445–453 (1954), http://www.jstor.org/stable/10.2307/1931034
Colberg, J.: Parallel Supercomputer Simulations of Cosmic Evolution. PhD thesis, Ludwig-Maximilians-Universität München (1999), http://edoc.ub.uni-muenchen.de/272/1/Colberg_Joerg.pdf
Connor, M., Kumar, P.: Fast construction of k-nearest neighbor graphs for point clouds. IEEE Transactions on Visualization and Computer Graphics 16(4), 599–608 (2009), http://compgeom.com/~piyush/papers/tvcg_stann.pdf
Lev-Tov, N., Peleg, D.: Exact algorithms and approximation schemes for base station placement problems. In: Penttonen, M., Meineche Schmidt, E. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 90–99. Springer, Heidelberg (2002), http://dl.acm.org/citation.cfm?id=645901.672620
Loftsgaarden, D.O., Quesenberry, C.P.: A nonparametric estimate of a multivariate density function. Annals of Mathematical Statistics 36(3), 1049–1051 (1965), http://projecteuclid.org/DPubS/Repository/1.0/Disseminate?view=body&id=pdf_1&handle=euclid.aoms/1177700079
Monaghan, J.J.: Smoothed particle hydrodynamics. Annual Review of Astronomy and Astrophysics 30, 543–574 (1992), http://www.annualreviews.org/doi/pdf/10.1146/annurev.aa.30.090192.002551
The Royal Society of Edinburgh. Digital Scotland (October 2010)
Schaap, W.E., van der Weygaert, R.: Continuous fields and discrete samples: reconstruction through delaunay tessellations. Astron. Astrophys. 363, L29–L32 (2000), http://www.astro.rug.nl/~weygaert/tim1publication/dtfeaaletter.pdf
Williamson, D.P., Shmoys, D.B.: The design of approximation algorithms. Cambridge University Press (June 2011), http://www.designofapproxalgs.com/book.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fourman, M.P. (2013). Hitting Buneman Circles. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, WC., Fourman, M. (eds) In Search of Elegance in the Theory and Practice of Computation. Lecture Notes in Computer Science, vol 8000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41660-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-41660-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41659-0
Online ISBN: 978-3-642-41660-6
eBook Packages: Computer ScienceComputer Science (R0)