Abstract
We provide a quasilinear time algorithm for the p-center problem with an additive error less than or equal to 3 times the input graph’s hyperbolic constant. Specifically, for the graph \(G=(V,E)\) with n vertices, m edges and hyperbolic constant \(\delta \), we construct an algorithm for p-centers in time \(O(p(\delta +1)(n+m)\log _2(n))\) with radius not exceeding \(r_p + \delta \) when \(p \le 2\) and \(r_p + 3\delta \) when \(p \ge 3\), where \(r_p\) are the optimal radii. Prior work identified p-centers with accuracy \(r_p+\delta \) but with time complexity \(O((n^3\log _2 n + n^2m)\log _2({{\mathrm{diam}}}(G)))\) which is impractical for large graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
For a comprehensive treatment of \(\delta \)-hyperbolicity see [1].
- 2.
The cited result also gives rise to an algorithm for general \(\delta \)-hyperbolic spaces whose running time depends on the time to compute \(F_S(x)\) for \(x\in X\) and \(S\subseteq X\). Because our interest is primarily in graphs, we direct the reader to [3] for details.
- 3.
The graphs p2p-gnutella25 and web-stanford are available publicly as part of the Stanford Large Network Dataset Collection. The sn-medium graph is extracted from the social network Facebook, and the sprintlink-1239 graph is an IP-layer network from the Rocketfuel ISP.
References
Bridson, M.R., Haefliger, A.: Metric Spaces of Non-positive Curvature, vol. 319. Springer Science & Business Media, Berlin (1999)
Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vaxès, Y.: Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. In: Proceedings of 24th Annual Symposium on Computational Geometry, pp. 59–68. ACM (2008)
Chepoi, V., Estellon, B.: Packing and covering \(\delta \)-hyperbolic spaces by balls. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX and RANDOM 2007. LNCS, vol. 4627, pp. 59–73. Springer, Heidelberg (2007)
Dyer, M.E., Frieze, A.M.: A simple heuristic for the p-centre problem. Oper. Res. Lett. 3(6), 285–288 (1985)
Edwards, K., Kennedy, W.S., Saniee, I.: Fast approximation algorithms for \(p\)-centres in large \(\delta \)-hyperbolic graphs (2016). arXiv preprint arXiv:1604.07359
Erkut, E.: The discrete p-dispersion problem. Eur. J. Oper. Res. 46(1), 48–60 (1990)
Erkut, E., Neuman, S.: Comparison of four models for dispersing facilities. INFOR 29, 68–86 (1991)
Erkut, E., Ülküsal, Y., Yenicerioglu, O.: A comparison of p-dispersion heuristics. Comput. Oper. Res. 21(10), 1103–1113 (1994)
Gromov, M.: Hyperbolic Groups. Springer, Berlin (1987)
Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180–184 (1985)
Hsu, W.-L., Nemhauser, G.L.: Easy and hard bottleneck location problems. Discrete Appl. Math. 1(3), 209–215 (1979)
Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM (JACM) 24(1), 1–13 (1977)
Kennedy, W.S., Narayan, O., Saniee, I.: On the hyperbolicity of large-scale networks. arXiv e-prints, June 2013
Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Facility dispersion problems: heuristics and special cases. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 355–366. Springer, Heidelberg (1991). doi:10.1007/BFb0028275
Shier, D.R.: A min-max theorem for p-center problems on a tree. Transp. Sci. 11(3), 243–252 (1977)
Acknowledgement
The authors are grateful to the anonymous reviewers for helpful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Edwards, K., Kennedy, S., Saniee, I. (2016). Fast Approximation Algorithms for p-centers in Large \(\delta \)-hyperbolic Graphs. In: Bonato, A., Graham, F., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2016. Lecture Notes in Computer Science(), vol 10088. Springer, Cham. https://doi.org/10.1007/978-3-319-49787-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-49787-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49786-0
Online ISBN: 978-3-319-49787-7
eBook Packages: Computer ScienceComputer Science (R0)