DocumentCode :
566507
Title :
A fast seat assignment algorithm based-on buckets data strcuture
Author :
Eu Jan, Gene ; Sun, Chi-Chia ; Li, Cheng-Hung ; Lin, Bor-Shing
Author_Institution :
Inst. of Electr. Eng., Nat. Taipei Univ., Taipei, Taiwan
Volume :
1
fYear :
2012
fDate :
24-26 April 2012
Firstpage :
11
Lastpage :
15
Abstract :
In this paper, a fast seat assignment algorithm is presented. This algorithm is original based on Left-Edge Algorithm (LEA) and enhanced by buckets data structure, where both time and space complexities are reduced from O(N log N) to O(N) dramatically. Our experimental results show that the proposed fast algorithm can be used to solve seat assignment problems with a minimal number of horizontal tracks efficiently.
Keywords :
computational complexity; data structures; LEA; O(N log N); O(N); buckets data structure; fast seat assignment algorithm; left-edge algorithm; space complexities; time complexities; Buckets; Channel Assignment; Channel Routing; Seat Assignment; Wire Routing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing Technology and Information Management (ICCM), 2012 8th International Conference on
Conference_Location :
Seoul
Print_ISBN :
978-1-4673-0893-9
Type :
conf
Filename :
6268462
Link To Document :
بازگشت