메뉴 건너뛰기





Volumn , Issue , 1997, Pages 88-95

Efficient heuristics for the minimum shortest path Steiner Arborescence problem with applications to VLSI physical design

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; VLSI CIRCUITS;

EID: 0030645153     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/267665.267695     Document Type: Conference Paper
Times cited : (3)

References (23)
  • Reference 정보가 존재하지 않습니다.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.