![]() |
Volumn , Issue , 1997, Pages 88-95
|
Efficient heuristics for the minimum shortest path Steiner Arborescence problem with applications to VLSI physical design
a
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
DATA COMMUNICATION SYSTEMS;
HEURISTIC METHODS;
INTEGRATED CIRCUIT LAYOUT;
VLSI CIRCUITS;
PHYSICAL DESIGN;
STEINER ARBORESCENCE PROBLEM;
TREES (MATHEMATICS);
|
EID: 0030645153
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1145/267665.267695 Document Type: Conference Paper |
Times cited : (3)
|
References (23)
|