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

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
Project Status Completed (Fiscal Year 2001)
Budget Amount *help
¥10,500,000 (Direct Cost: ¥10,500,000)
Fiscal Year 2000: ¥2,600,000 (Direct Cost: ¥2,600,000)
Fiscal Year 1999: ¥3,300,000 (Direct Cost: ¥3,300,000)
Fiscal Year 1998: ¥4,600,000 (Direct Cost: ¥4,600,000)
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.

Report

(4 results)
  • 2001 Final Research Report Summary
  • 2000 Annual Research Report
  • 1999 Annual Research Report
  • 1998 Annual Research Report
  • Research Products

    (27 results)

All Other

All Publications (27 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
      「研究成果報告書概要(和文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] T.Hirata, T.Ono: "Approximation Algorithms for MAXSAT"IICE Trans.on Information and Systems. Vo.E83-D No.3. 488-495 (2000)

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

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

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

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      2001 Final Research Report Summary
  • [Publications] 櫻井敦史,平田富夫: ""効率の良いモルフォロジー演算が可能なフィルタ形状について""情報処理学会論文誌,. Vol.41.No.12. 3344-3351 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Hirata,T.,Ono,T.: ""Approximation Algorithms for MAXSAT""Trans.of IEICE on Fundamentals. Vol.E83-D No.3. 488-495 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Fujito,T.: ""Approximation Algorithms for Submodular Set Cover with Applications""IEICE Trans.Inf.& Syst.. Vol.E83-D No.3. 170-177 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Carr,R.,Fujito,T.Konjevod,G.,Parekh,O.: ""A 21/(10) Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem""Lecture Notes in Computer Science. Vol.1879. 132-142 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] Fujito,T.,Nagamochi,H.: ""A 2-Approximation Algorithm for the Minimum Weight Edge Dominating Set Problem""Discrete Appl.Math..

    • Related Report
      2000 Annual Research Report
  • [Publications] 伊藤大介,小野孝男,平田富夫: ""ネット割当て問題のヒューリスティック解法に関する研究""電子情報通信学会技術研究報告書. COMP2000-14. 1-8 (2000)

    • Related Report
      2000 Annual Research Report
  • [Publications] 磯直行: "平面配線可能性検証アルゴリズムの実現"情報処理学会論文誌. Vol.40 No.4. 1636-1643 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Tan Xue-Hou: "Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes""International Journal of Computational Geometry & Applications. Vol.9. No.3. 319-323 (1999)

    • Related Report
      1999 Annual Research Report
  • [Publications] Tomio Hirata: "Approximation Algorithms for MAX SAT"Trans. of IEICE on Fundamentals. E83-A,No4(発行予定). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] Toshihiro Fujito: "Approximating Minimum Feedback Vertex Sets in Hyperraphs"Theoretical Computer Science. (発行予定). (2000)

    • Related Report
      1999 Annual Research Report
  • [Publications] 小野 孝男: "摂動法によるMAX SAT近似アルゴリズムの改良" 電子情報通信学会論文誌. J81-D-1No.9. 1107-1111 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] 磯 直行: "平面配線可能性検証アルゴリズムの実現" 情報処理学会論文誌. Vol.40,No.4(未定). (1999)

    • Related Report
      1998 Annual Research Report
  • [Publications] Toshihiro Fujito: "A Unified Approximation Algorithm for Node-Deletion Problems" Discrete Applied Mathematics. Vol.86. 213-231 (1998)

    • Related Report
      1998 Annual Research Report
  • [Publications] Toshihiro Fujito: "Approximating Node-Deletion Problems for Matroidal Properties" Journal of Algorithms. (未定).

    • Related Report
      1998 Annual Research Report

URL: 

Published: 1998-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi