Author:
Vukadinović Greetham Danica,Charlton Nathaniel,Poghosyan Anush
Publisher
Springer International Publishing
Reference28 articles.
1. Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 3–14. Springer, Heidelberg (2006)
2. Blondel, V., Guillaume, J., Lambiotte, R., Mech, E.: Fast unfolding of communities in large networks. J. Stat. Mech. 2008, P10008 (2008)
3. Bollobás, B.: Random Graphs, 2nd edn. Cambridge University Press (2001).
https://doi.org/10.1017/CBO9780511814068
4. Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1–122 (2011).
https://doi.org/10.1561/2200000016
5. Chen, N., Meng, J., Rong, J., Zhu, H.: Approximation for dominating set problem with measure functions. Comput. Inform. 23, 37–49 (2004)