arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1410.6516cs.MA
收藏

基于图的联盟结构生成

Coalition Structure Generation on Graphs

Talal Rahwan, Tomasz P. Michalak

摘要:

两种基本的算法设计范例是树搜索和动态规划。其中使用的技术已经被证明是在解决完整集合划分问题(也称为联盟结构生成问题)时相互补充的。受此启发,我们在本文中开发了一个算法来解决联盟结构生成问题的图,其目标是确定一个最佳的分区图连接的子图。更具体地说,我们开发了一种新的深度优先搜索算法,并将其与Vinyals等人[9]的现有动态规划算法相结合。由此产生的混合算法的经验表明,显着优于它的组成部分时,子集评估函数恰好具有一定的直观属性。

英文摘要:

Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition structure generation problem [5]. Inspired by this observation, we develop in this paper an algorithm to solve the coalition structure generation problem on graphs, where the goal is to identifying an optimal partition of a graph into connected subgraphs. More specifically, we develop a new depth-first search algorithm, and combine it with an existing dynamic programming algorithm due to Vinyals et al. [9]. The resulting hybrid algorithm is empirically shown to significantly outperform both its constituent parts when the subset-evaluation function happens to have certain intuitive properties.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑