• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2001 Fiscal Year Final Research Report Summary

Approximation Algorithms for Combinatorial Optimization Problems

Research Project

Project/Area Number 10205208
Research Category

Grant-in-Aid for Scientific Research on Priority Areas (B)

Allocation TypeSingle-year Grants
Research InstitutionNagoya 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
Keywordsapproximating 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.

  • Research Products

    (13 results)

All Other

All Publications (13 results)

  • [Publications] T.Ono, T.Hirata: "An Improved Algorithm for the Net Assignment Problem"IEICE Trans.On Fundamentals. Vol.E84-A No.5. 1161-1165 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Hirata, T.Ono: "Approximation Algorithms for MAXSAT"IICE Trans.on Information and Systems. Vo.E83-D No.3. 488-495 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] A.Sakurai, T.Hirata: "On a Class of Efficient Computable Morphological filters"Trans.of Information Processing Society Japan. Vol.41No.12. 3344-3351 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] N.Iso, T.Hirata: "Implementation of Routability Checking Algorithm for Planar Layouts"IEICE Trans.on Information and Systems. Vol.40No.4. 1636-1643 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Fujito: "Approximatilon Algorithms for Submodular Set Cover with Applications"IEICE Trans.on Information and Systems. Vol.E83-D NO.3. 170-177 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Fujito: "On Approximability of the independent/connected edge dominating set problems"Proc.20^<th> FSTTCS(LNCS 1974). 117-126 (2000)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 譚学厚, 平田富夫: "計算幾何学入門"森北出版. 182 (2001)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] T.Ono and T.Hirata: "An Improved Algorithm for the Net Assignment Problem"IEICE Trans. on Fundamentals. Vol.E84-A, No.5. 1161-1165 (2001)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T.Hirata and T.Ono: "Approximation Algorithms for MAXSAT"IEICE Trans. on Information and Systems. Vol.E83-D, No.3. 488-495 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] A.Sakurai and T.Hirata: "On a Class of Efficient Computable Morphological filters"Trans. of Information Processing Society Japan. Vol.41, No.12. 3344-3351 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] N.Iso and T.Hirata: "Implementation of Routability Checking Algorithm for Planar Layouts"IEICE Trans. on Information and Systems. Vol.40, No.4. 1636-1643 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T,Fujito: "Approximation Algorithms for Submodular Set Cover with Applications"IEICE Trans. on Information and Systems. Vol.E83-D, No.3. 170-177 (2000)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] T,Fujito: "On Approximability of the independent/connected edge dominating set problems"Proc. 20^<th> FSTTCS (LNCS1974). 117-126 (2000)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 2003-09-17  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi