Abstract
We consider the problem of minimizing communication overhead while balancing load across cooperative agents. In the past, similar problems have been modeled as the balanced node partitioning problem, where the objective is to partition the nodes into components such that each component has roughly the same number of nodes while the number of edges connecting components is minimized. We describe some real-world scenarios where one needs to find partitions in which all components have an approximately equal number of edges, while minimizing the number of edges connecting components. We introduce the (k, r)-Balanced Edge Partitioning problem to model this type of scenario and present approximation algorithms for this problem on certain graphs. In addition, we present five heuristics for the restricted case of the problem. We evaluate these heuristics on three kinds of graphs: power network-like graphs, preferential attachment graphs, and the class of spatial preferential attachment graphs that we introduce in this paper. Our results show that the choice of the heuristic with the best results depends on the properties of the input graph and the quality of our solution depends on the initial conditions.
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
Andreev, K., Räcke, H.: Balanced graph partitioning. In: SPAA ’04: Proceedings of the sixteenth annual ACM symposium on parallelism in algorithms and architectures, pp. 120–124. ACM Press, New York, NY, USA (2004)
Barabási, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Davis, T.: A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. ACM Transactions on Mathematical Software 30(2), 165–195 (2004)
Garey, M., Johnson, D.: Computers and Intractability. In: Garey, M., Johnson, D. (eds.) A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York (1979)
Hendrickson, B., Leland, R.: The Chaco user’s guide version 2.0. Technical Report SAND95-2344, Sandia National Laboratories, Albuquerque, NM (July 1995)
Jung, H., Tambe, M.: Performance models for large scale multiagent systems: using distributed POMDP building blocks. In: AAMAS ’03. Proceedings of the second international joint conference on autonomous agents and multiagent systems, pp. 297–304. ACM Press, New York, NY, USA (2003)
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Journal 49, 291–307 (1972)
Rosen, K.: Discrete Mathematics and Its Applications, 5th edn. McGraw Hill, New York (2003)
Saran, H., Vazirani, V.: Finding k-cuts within twice the optimal. SIAM Journal of Computing 24(1), 101–108 (1995)
Simon, H., Teng, S.: How good is recursive bisection? SIAM Journal of Scientific Computing 18(5), 1436–1445 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Smorodkina, E., Thakur, M., Tauritz, D. (2007). Algorithms for the Balanced Edge Partitioning Problem. In: Demetrescu, C. (eds) Experimental Algorithms. WEA 2007. Lecture Notes in Computer Science, vol 4525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72845-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-72845-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72844-3
Online ISBN: 978-3-540-72845-0
eBook Packages: Computer ScienceComputer Science (R0)