|
| Yasuhiro TAKASHIMA
|
Complexity and Exact Solution of Set-Pair Routing Problem Yasuhiro TAKASHIMA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2026/03/01
Vol. E109-A
No. 3
pp. 590-595
Type of Manuscript:
Special Section PAPER (Special Section on VLSI Design and CAD Algorithms) Category: Keyword: set-pair routing problem, NP-hard, integer linear programming, | | | Summary | Full Text:PDF | |
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|