Two-Way Greedy Sort and Ratio Cut Technique for Optimal Linear Arrangement

• Main Authors: Chao-hsun Wu, 吳昭勳
• Other Authors: Te-chien Tsai
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/81900036379154951727

碩士 === 南華大學 === 資訊管理學研究所 === 96 === 　　Wireless broadcasting environment, the use of bandwidth is still one of the hottest topics. So the limited bandwidth of information on how to make broadcasting more efficient for wireless networks on one of the main themes. However server-side (Server) efficient scheduling information on the radio, not only can save the client (Client) access to information in the time it takes, can also save send, receive, both energy consumption and improve overall network Performance. 　　 　　The directed linear arrangement is a widely used and studied problem in task-scheduling and wireless data broadcast. This paper presents algorithms with different levels of complexity aiming at this problem which include a hybrid ratio cut greedy sort algorithm and a equivalent edge clustering algorithm. The hybrid ratio cut greedy sort algorithm, using the two-way greedy sort and recursive bipartition, is a highly efficient local search algorithm with global optimization. 　　 　　The equivalent edge clustering algorithm uses equivalent edge technique to replace edges, and uses the directed HAC process to merge vertices into a segment. With the equivalent edge set technique we can improve the solution quality of clustering vertices in directed graph.