2001 Fiscal Year Final Research Report Summary
Approximation Algorithms for Combinatorial Optimization Problems
| Project/Area Number |
10205208
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research on Priority Areas (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Institution | Nagoya University |
|---|
Principal Investigator |
HIRATA Tomio School of Engineering, Nagoya University, Professor, 工学研究科, 教授 (10144205)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
ISO Naoyuki Chukyo Univercity, Associate Professor, 情報科学部, 講師 (80283406)
ONO Takao School of Engineering, Nagoya University, Assistant Professor, 工学研究科, 助手 (60311718)
FUJITO Toshihiro School of Engineering, Nagoya University, Associate Professor, 工学研究科, 助教授 (00271073)
|
|---|
| Project Period (FY) |
1998 – 2000
|
| Keywords | approximating algorithms / via minimization / distance transform / net assignment / edge dominating set / morphological filter / petri-net |
|---|
| Research Abstract |
The purpose of this research is to design approximation algorithms for various combinatorial optimization problems and to analyze their approximation ratios.
The results obtained are as follows.
(1) We designed an efficient algorithm for the net assignment problem in logic emulator, which is used for logic verification process in designing large scale circuits.
(2) We proposed an algorithm for the minimization of the number of vias in the VLSI layout design.
(3) We designed an efficient algorithm for the Euclidean distance transform and give an uniform method for morphlogical operations in picture processing.
(4) Approximability of edge dominating set problem and its related ones are also investigated.
|
