I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Multi-layer chip-level global routing using an efficient gr..:
, In:
Proceedings of the 1997 European conference on Design and Test
,
Liu, Le-Chin Eugene
;
Sechen, C.
- p. 311 ff. , 1997
Link:
https://dl.acm.org/doi/10.5555/787260.787682
RT T1
Proceedings of the 1997 European conference on Design and Test
: T1
Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic
UL https://suche.suub.uni-bremen.de/peid=acm-787682&Exemplar=1&LAN=DE A1 Liu, Le-Chin Eugene A1 Sechen, C. PB IEEE Computer Society YR 1997 K1 3D mixed directed/undirected routing graph K1 NP-hard problem K1 Steiner minimum trees K1 Steiner tree heuristic algorithm K1 chip-level global routing K1 global routing model K1 graph-based Steiner tree heuristic K1 large routing graphs K1 multilayer macro-cell technology K1 multilayer routing problem K1 network routing K1 routing resource congestion problems K1 space complexity K1 time complexity K1 vias minimisation K1 wire length minimisation K1 Mathematics of computing K1 Discrete mathematics K1 Graph theory K1 Graph algorithms K1 Theory of computation K1 Design and analysis of algorithms K1 Approximation algorithms analysis K1 Routing and network design problems SP 311 ff. LK http://dx.doi.org/https://dl.acm.org/doi/10.5555/787260.787682 DO https://dl.acm.org/doi/10.5555/787260.787682 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)