Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/ispd/CongKL97
%A Cong, Jason
%A Kahng, Andrew B.
%A Leung, Kwok-Shing
%B ISPD
%D 1997
%E Kahng, Andrew B.
%E Sarrafzadeh, Majid
%I ACM
%K dblp
%P 88-95
%T Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design.
%U http://dblp.uni-trier.de/db/conf/ispd/ispd1997.html#CongKL97
%@ 0-89791-927-0
@inproceedings{conf/ispd/CongKL97,
added-at = {2017-02-08T00:00:00.000+0100},
author = {Cong, Jason and Kahng, Andrew B. and Leung, Kwok-Shing},
biburl = {https://www.bibsonomy.org/bibtex/2efbc1def17def863ea1268282fc4c61f/dblp},
booktitle = {ISPD},
crossref = {conf/ispd/1997},
editor = {Kahng, Andrew B. and Sarrafzadeh, Majid},
ee = {http://doi.acm.org/10.1145/267665.267695},
interhash = {34368da374ce7239ceb91a8532e1afa8},
intrahash = {efbc1def17def863ea1268282fc4c61f},
isbn = {0-89791-927-0},
keywords = {dblp},
pages = {88-95},
publisher = {ACM},
timestamp = {2017-02-09T11:43:20.000+0100},
title = {Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design.},
url = {http://dblp.uni-trier.de/db/conf/ispd/ispd1997.html#CongKL97},
year = 1997
}