New Optimal Layer Assignment for Bus-Oriented Escape Routing

CHUR > College Computer Science and Informatics > Department of Computer Science and Information Engineering > Seminar Papers > Item 987654321/32036

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/32036

Title:	New Optimal Layer Assignment for Bus-Oriented Escape Routing
Authors:	顏金泰 YAN, JIN-TAI
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	Escape routing;Layer assignment;Bus
Date:	2011
Issue Date:	2014-06-27 01:42:13 (UTC+8)
Abstract:	In this paper, based on the optimal feature of a left-edge algorithm for interval packing, a modified left-edge algorithm is proposed to optimally solve the layer assignment problem for bus-oriented escape routing. Firstly, a set of assignment constraints
Appears in Collections:	[Department of Computer Science and Information Engineering] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_e331_0396.pdf		28Kb	Adobe PDF	93	View/Open