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

Fuzito Toshihiro  藤戸 敏弘

ORCIDConnect your ORCID iD *help
… Alternative Names

FUJITO Toshihiro  藤戸 敏弘

Less
Researcher Number 00271073
Other IDs
Affiliation (Current) 2025: 愛知産業大学短期大学, 国際コミュニケーション学科, 教授
Affiliation (based on the past Project Information) *help 2011 – 2023: 豊橋技術科学大学, 工学(系)研究科(研究院), 教授
2010: Toyohashi University of Technology, 大学院・工学研究科, 教授
2004 – 2009: Toyohashi University of Technology, Engineering, Professor, 工学部, 教授
2003: 名古屋大学, 情報科学研究科, 助教授
2002: NAGOYA UNIV., ASSCE. Prot. Graduate School of Engineering, 工学系研究科, 助教授 … More
2000 – 2002: School of Engineering, Nagoya University, Associate Professor, 工学研究科, 助教授
1999: 名古屋大学, 工学研究科, 講師
1998: 広島大学, 工学部, 助手 Less
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / Theory of informatics / Basic Section 60010:Theory of informatics-related / 計算機科学
Except Principal Investigator
計算機科学 / Science and Engineering
Keywords
Principal Investigator
近似アルゴリズム / 辺支配集合問題 / 線形計画緩和 / 連結頂点被覆 / 頂点被覆問題 / 貧欲法 / NP困難問題 / 辺支配集合 / 頂点除去問題 / アルゴリズム … More / 主双対法 / 有向グラフ / 弦グラフ / 恒久的被覆問題 / power被覆 / 次数制限除去問題 / bマッチング / Approximation Algorithm / 近似保証 / 組合せ最適化問題 / NP困難離散最適化問題 / オンライン問題 / スキーレンタル問題 / 準線形時間アルゴリズム / アルゴリズム設計論 / 迂回度 / 要節点 / 恒久的連結辺支配集合問題 / 恒久的辺支配集合問題 / 帰還点集合問題 / 部分頂点被覆問題 / パワー頂点被覆問題 / 理論保証 / パス頂点被覆 / 制限次数除去問題 / 最小ヒント数問題 / 立体ピクロス / Power Vertex Cover / Power頂点被覆 / greedy algorithm / primal-dual method / LP relaxation / approximation algorithm / combinatorial optimization / NP-hardness / 貪欲法 / 近似解法 / Set Packing Problem / Covering Problem / Submodular Set Cover / 連結辺支配 / 並列アルゴリズム / 劣モジュラ被覆 / 集合パッキング問題 / 被覆型問題 / 劣モジュラ集合被覆 / Linear program relaxation / Set Cover problem / Edge Dominating Set problem / Greedy heuristic / Covering problem / Packing Problem / NP-hard problem / 貪欲解法(グリーディ法) / マトロイド / 集合被覆問題 / 被覆問題 / 充填問題 / 競合比 / オンラインアルゴリズム / 初等的二部グラフ / 頂点被覆数 / 最適二分木 / ハフマン符号化 / 頂点被覆 / 分散アルゴリズム / 連結辺支配集合 / 多重辺支配集合 / 組合せ最適化 / 近似的最小最大関係 / 木被覆問題 / シュタイナー木問題 / 競合比解析 / グラフの独立集合問題 / 局所探索法 / 最適競合比 / アルゴリズム理論 … More
Except Principal Investigator
近似アルゴリズム / edge dominating set / 摂動 / 充足最大化問題 / 最大カット問題 / レイアウト設計 / ペトリネット / 辺支配集合問題 / 距離変換 / logic emulator / layout design / max cut / satisfiability problem / approximation algorithm / 判定値計画法 / マトロイド / 頂点除去問題 / ネット割り当て問題 / 論理エミュレータ / 辺支配集合 / 充足可能性問題 / petri-net / morphological filter / net assignment / distance transform / via minimization / approximating algorithms / 半定値計画法 / モルフォロジー / ネット割当て問題 / ビア数最小化 / 性能保障 / 近似化 / 性能保証 / 近似比 / アルゴリズム Less
  • Research Projects

    (11 results)
  • Research Products

    (82 results)
  • Co-Researchers

    (5 People)
  •  準線形時間アルゴリズムの設計理論に関する研究Principal Investigator

    • Principal Investigator
      藤戸 敏弘
    • Project Period (FY)
      2020 – 2024
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Toyohashi University of Technology
  •  A Study on Performance Guarantee for Algorithmic Processing of Large Scale DataPrincipal Investigator

    • Principal Investigator
      Fujito Toshihiro
    • Project Period (FY)
      2017 – 2021
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Toyohashi University of Technology
  •  A Study on Algorithm Designs for Processing Large Scale Sequential DataPrincipal Investigator

    • Principal Investigator
      Fujito Toshihiro
    • Project Period (FY)
      2014 – 2017
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Toyohashi University of Technology
  •  Developing Algorithm Designs for Large Scale Combinatorial Optimization ProblemsPrincipal Investigator

    • Principal Investigator
      FUJITO TOSHIHIRO
    • Project Period (FY)
      2011 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Toyohashi University of Technology
  •  Developing the Algorithm Theory for Combinatorial Optimization based on Hybrid ApproachesPrincipal Investigator

    • Principal Investigator
      FUJITO Toshihiro
    • Project Period (FY)
      2008 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Toyohashi University of Technology
  •  Development ofAlgorithm Theory for Dealing with Computational Uncertainty and its Engineering ApplicationsPrincipal Investigator

    • Principal Investigator
      FUJITO Toshihiro
    • Project Period (FY)
      2005 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Toyohashi University of Technology
  •  高性能近似アルゴリズムの設計法に関する研究

    • Principal Investigator
      HIRATA Tomio
    • Project Period (FY)
      2004 – 2007
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas
    • Review Section
      Science and Engineering
    • Research Institution
      Nagoya University
  •  Development of Algorithm Theory Based on Mathematical Programming and Probability TyeoryPrincipal Investigator

    • Principal Investigator
      FUJITO Toshihiro
    • Project Period (FY)
      2003 – 2004
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Toyohashi University of Technology
      Nagoya University
  •  A Study on Approximation Algorithm Design Based on Linear ProgramPrincipal Investigator

    • Principal Investigator
      FUJITO Toshihiro
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      NAGOYA UNIVERSITY
  •  Approximation Algorithms for Combinatorial Optimization Problems

    • Principal Investigator
      HIRATA Tomio
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (B)
    • Research Institution
      Nagoya University
  •  A Study of Approximation Algorithms for Combinatorial Optimization Problems

    • Principal Investigator
      HIRATA Tomio
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      計算機科学
    • Research Institution
      Nagoya University

All 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2006 2005 2004 Other

All Journal Article Presentation

  • [Journal Article] A note on approximations of directed edge dominating set2023

    • Author(s)
      Fujito Toshihiro
    • Journal Title

      Information Processing Letters

      Volume: 179 Pages: 106303-106303

    • DOI

      10.1016/j.ipl.2022.106303

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K11676
  • [Journal Article] Approximating Power Node-Deletion Problems2023

    • Author(s)
      Fujito Toshihiro、Mukae Kneto、Tsuzuki Junya
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13898 Pages: 217-231

    • DOI

      10.1007/978-3-031-30448-4_16

    • ISBN
      9783031304477, 9783031304484
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20K11676
  • [Journal Article] On b-Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 4-Edge Dominating Set Problem2021

    • Author(s)
      Fujito Toshihiro、Tatematsu Takumi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12982 Pages: 65-79

    • DOI

      10.1007/978-3-030-92702-8_5

    • ISBN
      9783030927011, 9783030927028
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00013, KAKENHI-PROJECT-20K11676
  • [Journal Article] Eternal Connected Vertex Cover Problem2020

    • Author(s)
      Fujito Toshihiro、Nakamura Tomoya
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12337 Pages: 181-192

    • DOI

      10.1007/978-3-030-59267-7_16

    • ISBN
      9783030592660, 9783030592677
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00013, KAKENHI-PROJECT-20K11676
  • [Journal Article] Power Vertex Cover問題の近似アルゴリズムについて2020

    • Author(s)
      立松 拓己,林谷 哲郎,藤戸 敏弘
    • Journal Title

      電子情報通信学会技術研究報告

      Volume: 119 Pages: 29-34

    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Journal Article] Approximating Partially Bounded Degree Deletion on Directed Graphs2019

    • Author(s)
      Fujito Toshihiro、Kimura Kei、Mizuno Yuki
    • Journal Title

      Journal of Graph Algorithms and Applications

      Volume: 23 Issue: 5 Pages: 759-780

    • DOI

      10.7155/jgaa.00511

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Journal Article] The fewest clues problem of picross 3D2018

    • Author(s)
      Kimura, K., Kamehashi, T., Fujito, T.
    • Journal Title

      Leibniz International Proceedings in Informatics, LIPIcs

      Volume: 100

    • DOI

      10.4230/LIPIcs.FUN.2018.25

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Journal Article] On Approximating (Connected) 2-Edge Dominating Set by a Tree2018

    • Author(s)
      Fujito, T., Shimoda, T.
    • Journal Title

      Theory of Computing Systems

      Volume: 62 Issue: 3 Pages: 533-556

    • DOI

      10.1007/s00224-017-9764-y

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Journal Article] Approximating Partially Bounded Degree Deletion on Directed Graphs2018

    • Author(s)
      Fujito Toshihiro、Kimura Kei、Mizuno Yuki
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10755 Pages: 32-43

    • DOI

      10.1007/978-3-319-75172-6_4

    • ISBN
      9783319751719, 9783319751726
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00013, KAKENHI-PROJECT-26330010
  • [Journal Article] Approximating Bounded Degree Deletion via Matroid Matching2017

    • Author(s)
      Fujito Toshihiro
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10236 Pages: 234-246

    • DOI

      10.1007/978-3-319-57586-5_20

    • ISBN
      9783319575858, 9783319575865
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00013, KAKENHI-PROJECT-26330010
  • [Journal Article] Online Weight Balancing on the Unit Circle2016

    • Author(s)
      H. Fujiwara, T. Seki, T. Fujito
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E99-D Pages: 567-574

    • NAID

      130005131814

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-26330010
  • [Journal Article] Competitive Analysis for the Flat-Rate Problem2016

    • Author(s)
      Hiroshi Fujiwara, Atsushi Matsuda, and Toshihiro Fujito
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E99.D Issue: 3 Pages: 559-566

    • DOI

      10.1587/transinf.2015FCP0005

    • NAID

      130005131810

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-23700014, KAKENHI-PROJECT-26330010
  • [Journal Article] Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers2016

    • Author(s)
      T. Fujito, D. Suzuki
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9627 Pages: 251-262

    • DOI

      10.1007/978-3-319-30139-6_20

    • ISBN
      9783319301389, 9783319301396
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-26330010
  • [Journal Article] Competitive Analysis for the 3-Slope Ski-Rental Problem with the Discount Rate2016

    • Author(s)
      Hiroshi Fujiwara, Shunsuke Satou, and Toshihiro Fujito
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E99.A Issue: 6 Pages: 1075-1083

    • DOI

      10.1587/transfun.E99.A.1075

    • NAID

      130005154229

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00033, KAKENHI-PROJECT-26330010
  • [Journal Article] The Huffman Tree Problem with Unit Step Functions2015

    • Author(s)
      H. Fujiwara, T. Nakamura, T. Fujito
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E98.A Issue: 6 Pages: 1189-1196

    • DOI

      10.1587/transfun.E98.A.1189

    • NAID

      130005071830

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-26330010, KAKENHI-PROJECT-23700014
  • [Journal Article] On the Eternal Vertex Cover Numbers of Generalized Trees2015

    • Author(s)
      H. Araki, T. Fujito, S. Inoue
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E98.A Issue: 6 Pages: 1153-1160

    • DOI

      10.1587/transfun.E98.A.1153

    • NAID

      130005071826

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-26330010
  • [Journal Article] Multi-Rooted Greedy Approximation of Directed Steiner Trees with Applications2015

    • Author(s)
      Tomoya Hibi, Toshihiro Fujito
    • Journal Title

      Algorithmica

      Volume: 未定 Issue: 2 Pages: 1-9

    • DOI

      10.1007/s00453-015-9973-1

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-23500014, KAKENHI-PROJECT-26330010
  • [Journal Article] On the Best Possible Competitive Ratio for the Multislope Ski-Rental Problem2014

    • Author(s)
      Hiroshi Fujiwara, Takuma Kitano, and Toshihiro Fujito
    • Journal Title

      Journal of Combinatorial Optimization (JOCO)

      Volume: Online ISSN 1573-2886 Issue: 2 Pages: 463-490

    • DOI

      10.1007/s10878-014-9762-9

    • NAID

      120007100502

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-23700014, KAKENHI-PROJECT-26330010
  • [Journal Article] Analysis of Lower Bounds for the Multislope Ski-Rental Problem2014

    • Author(s)
      Hiroshi Fujiwara, Yasuhiro Konno, and Toshihiro Fujito
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E97.A Issue: 6 Pages: 1200-1205

    • DOI

      10.1587/transfun.E97.A.1200

    • NAID

      130004770849

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-23700014, KAKENHI-PROJECT-26330010
  • [Journal Article] How to guard a graph against tree moves2013

    • Author(s)
      T. Fujito, T. Sakamaki
    • Journal Title

      Information Processing Letters

      Volume: 113 Issue: 19-21 Pages: 844-847

    • DOI

      10.1016/j.ipl.2013.07.025

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Journal Article] How to Guard a Graph Against a Tree Movement2012

    • Author(s)
      T. Fujito, T. Sakamaki
    • Journal Title

      Proc. 18th Computing: the Australasian Theory Symposium (CATS 2012)

      Volume: 128 Pages: 93-96

    • NAID

      10031108795

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Journal Article] How to Trim a MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover2012

    • Author(s)
      T. Fujito
    • Journal Title

      ACM Trans. Algorithms

      Volume: 8 Issue: 2 Pages: 1-11

    • DOI

      10.1145/2151171.2151179

    • NAID

      110004824078

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Journal Article] Multi-Rooted Greedy Approximation of Directed Steiner Trees with Applications2012

    • Author(s)
      T. Hibi, T. Fujito
    • Journal Title

      Proc. 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG '12)

      Volume: 7551 Pages: 215-224

    • DOI

      10.1007/978-3-642-34611-8_23

    • ISBN
      9783642346101, 9783642346118
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Journal Article] On the Best Possible Competitive Ratio for Multislope Ski Rental2011

    • Author(s)
      H. Fujiwara, T. Kitano, T. Fujito
    • Journal Title

      Proc. 22nd ISAAC (International Symposium on Algorithms and Computation)

      Volume: 7074 Pages: 544-553

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Journal Article] 多状態スキーレンタル問題に対する最適競合比の解析2011

    • Author(s)
      北野琢麻, 藤原洋志, 藤戸敏弘
    • Journal Title

      情報処理学会研究報告 2011-AL-133

      Pages: 1-8

    • Data Source
      KAKENHI-PROJECT-20500009
  • [Journal Article] 多状態スキーレンタル問題に対する最適競合比の解析2011

    • Author(s)
      北野琢麻, 藤原洋志, 藤戸敏弘
    • Journal Title

      情報処理学会研究報告

      Volume: 2011-AL-133 Pages: 1-8

    • Data Source
      KAKENHI-PROJECT-20500009
  • [Journal Article] d-claw freeグラフ上の独立集合問題に対する局所探索法について2010

    • Author(s)
      北山数行, 藤戸敏弘
    • Journal Title

      電子情報通信学会技術研究報告 COMP2009-54

      Pages: 33-38

    • NAID

      110008000710

    • Data Source
      KAKENHI-PROJECT-20500009
  • [Journal Article] d-claw free グラフ上の独立集合問題に対する局所探索法について2010

    • Author(s)
      北山数行, 藤戸敏弘
    • Journal Title

      電子情報通信学会技術研究報告 109

      Pages: 33-38

    • NAID

      110008000710

    • Data Source
      KAKENHI-PROJECT-20500009
  • [Journal Article] 層別グラフにおける有向木被覆問題の近似について2009

    • Author(s)
      多田哲馬, 藤戸敏弘
    • Journal Title

      数理解析研究所購求録 5

      Pages: 153-159

    • Data Source
      KAKENHI-PROJECT-20500009
  • [Journal Article] How to trim an MST : A 2-approximation algorithm for minimum cost tree cover2006

    • Author(s)
      T.Fujito
    • Journal Title

      Lecture Notes in Computer Science (Proc. 33rd ICALP) 4051

      Pages: 431-442

    • NAID

      110004824078

    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] How to trim an MST : A 2-approximation algorithm for minimum cost tree cover2006

    • Author(s)
      Fujito, T
    • Journal Title

      Lecture Notes in Computer Science 4051

      Pages: 431-442

    • NAID

      110004824078

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] How to trim an MST : A 2-approximation algorithm for minimum cost tree cover2006

    • Author(s)
      T.Fujito
    • Journal Title

      Lecture Notes in Computer Science (Proc. 33rd ICALP) 4051

      Pages: 431-442

    • NAID

      110004824078

    • Data Source
      KAKENHI-PROJECT-16092211
  • [Journal Article] How to trim an MST: A 2-approximation algorithm for minimum cost tree cover2006

    • Author(s)
      Fujito, T.
    • Journal Title

      Lecture Notes in Computer Science(Proc. 33rd ICAILP) 4051

      Pages: 431-442

    • NAID

      110004824078

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A Modified Greedy Algorithm for Dispersively Weighted 3-Set Cover2006

    • Author(s)
      T.Fujito, T.Okumura
    • Journal Title

      Discrete Applied Mathematics 154(9)

      Pages: 1392-1400

    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A modified greedy algorithm for dispersively weighted 3-set cover2006

    • Author(s)
      Fujito, T., Okumura, T.
    • Journal Title

      Discrete APPlied Mathematics 154(9)

      Pages: 1392-1400

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A primal-dual method for approximating tree cover with two weights2006

    • Author(s)
      Doi, T., Fujito, T
    • Journal Title

      Discrete Optimization 3-3

      Pages: 230-237

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A modified greedy algorithm for dispersively weighted 3-set cover2006

    • Author(s)
      Fujito, T., Okumura, T
    • Journal Title

      Discrete Applied Mathematics 154-9

      Pages: 1392-1400

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A Better-than-Greedy Algorithm for $k$-Set Multicover2006

    • Author(s)
      T.Fujito, H.Kurahashi
    • Journal Title

      Lecture Notes in Computer Science Vol.3879

      Pages: 176-189

    • Data Source
      KAKENHI-PROJECT-16092211
  • [Journal Article] A primal-dual method for approximating tree cover with two weights2006

    • Author(s)
      Doi, T., Fujito, T.
    • Journal Title

      Discrete Optimization 3(3)

      Pages: 230-237

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A Primal-Dual Method for Approximating Tree Cover with Two Weights2006

    • Author(s)
      T.Doi, T.Fujito
    • Journal Title

      Discrete Optimization Vol. 3 No. 3

      Pages: 230-237

    • Data Source
      KAKENHI-PROJECT-16092211
  • [Journal Article] A Modified Greedy Algorithm for Dispersively Weighted 3-Set Cover2006

    • Author(s)
      T.Fujito, T.Okumura
    • Journal Title

      Discrete Applied Mathematics Vol. 154 No.9

      Pages: 1392-1400

    • Data Source
      KAKENHI-PROJECT-16092211
  • [Journal Article] A Primal-Dual Method for Approximating Tree Cover with Two Weights2006

    • Author(s)
      T.Doi, T.Fujito
    • Journal Title

      Discrete Optimization 3(3)

      Pages: 230-237

    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A better-than-greedy algorithm for k-set multicover2005

    • Author(s)
      Fujito, T., Kurahashi, H
    • Journal Title

      Lecture Notes in Computer Science 3879

      Pages: 176-189

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] 集合多重被覆問題に対する貧欲法の改良2005

    • Author(s)
      倉橋秀和, 藤戸敏弘
    • Journal Title

      電子情報通信学会コンピュテーション研究会技術研究報告 COMP2004-61

      Pages: 9-16

    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] Submodular Integer Cover and its Application to Production Planning2005

    • Author(s)
      Fujito, T., Yabuta, T.
    • Journal Title

      Lecture Notes in Computer Science 3351

      Pages: 154-166

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] Submodular integer cover and its application to production planning2005

    • Author(s)
      Fujito, T., Yabuta, T.
    • Journal Title

      Lecture Notes in Computer Science 3351

      Pages: 154-166

    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] 重みつき集合充填問題に対する局所改善法について2005

    • Author(s)
      大竹将知, 藤戸敏弘
    • Journal Title

      電子情報通信学会コンピュテーション研究会技術研究報告 COMP2004-62

      Pages: 17-22

    • NAID

      110003206415

    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] A better-than-greedy algorithm for k-set multicover2005

    • Author(s)
      Fujito, T., Kurahashi, H.
    • Journal Title

      Lecture Notes in Computer Science 3879

      Pages: 176-189

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A 2-Approximation NC Algorithm for Connected Vertex Cover and Tree Cover2004

    • Author(s)
      Fujito, T., Doi, T.
    • Journal Title

      Information Processing Letters 90-2

      Pages: 59-63

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] 被覆容量/要求量付き部分頂点被覆問題の2倍近似解法2004

    • Author(s)
      藪田隆俊, 藤戸敏弘
    • Journal Title

      電子情報通信論文誌 D-I J87-D-I・11

      Pages: 1-8

    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] On Combinatorial Approximation of Covering 0-1 Integer Program and Partial Set Cover2004

    • Author(s)
      Fujito, T.
    • Journal Title

      J.Combinatorial Optimization 8

      Pages: 439-452

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] On Combinatorial Approximation of Covering 0-1 Integer Program and Partial Set Cover2004

    • Author(s)
      Fujito, T.
    • Journal Title

      J.Combinatorial Optimization 8-4

      Pages: 439-452

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] A 2-Approximation NC Algorithm for Connected Vertex Cover and Tree Cover2004

    • Author(s)
      Fujito, T., Doi, T.
    • Journal Title

      Information Processing Letters 90

      Pages: 59-63

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] A Primal-Dual Method for Approximating Tree Cover with Two Weights2004

    • Author(s)
      Doi, T., Fujito, T.
    • Journal Title

      Electronic Notes in Discrete Mathematics 17

      Pages: 135-140

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] On Combinatorial Approximation of Covering 0-1 Integer Program and Partial Set Cover2004

    • Author(s)
      Fujito, T
    • Journal Title

      Journal of Combinatorial Optimization 8・4

      Pages: 439-452

    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] 被覆容量/要求量付き部分頂点被覆問題の2倍近似解法2004

    • Author(s)
      藪田隆俊, 藤戸敏弘
    • Journal Title

      電子情報通信学会論文誌D-I J87-D-I

      Pages: 1-8

    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] A Primal-Dual Method for Approximating Tree Cover with Two Weights2004

    • Author(s)
      Doi, T., Fujito, T.
    • Journal Title

      Proc.3^<rd> CTW Workshop on Graphs and Combinatorial Optimization 8・4

      Pages: 119-123

    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] A 2-Approximation Algorithm for Capacitated Vertex Cover with Demands2004

    • Author(s)
      Yabuta, T., Fujito, T.
    • Journal Title

      IEICE Transaction D-I J87-D-I-11

      Pages: 1-8

    • Description
      「研究成果報告書概要(欧文)」より
    • Data Source
      KAKENHI-PROJECT-15500008
  • [Journal Article] A modified greedy algorithm for dispersively weighted 3-set cover

    • Author(s)
      Fujito, T., Okumura, T.
    • Journal Title

      Discrete Applied Mathematics (To appear)

    • Data Source
      KAKENHI-PROJECT-17500006
  • [Journal Article] A primal-dual method for approximating tree cover with two weights

    • Author(s)
      Doi, T., Fujito, T.
    • Journal Title

      Discrete Applied Mathematics (To appear)

    • Data Source
      KAKENHI-PROJECT-17500006
  • [Presentation] 辺支配集合問題および連結辺支配集合問題の恒久化について2024

    • Author(s)
      松田紘輝,藤戸敏弘
    • Organizer
      2024年電子情報通信学会総合大会
    • Data Source
      KAKENHI-PROJECT-20K11676
  • [Presentation] Algorithm for Detour Hinge Vertex Problem of Circular-arc Graphs2022

    • Author(s)
      Tomonari Izumi , Syoma Nameki , Yoko Nakajima , Hirotoshi Honma , Toshihiro Fujito
    • Organizer
      The 41st JSST Annual International Conference on Simulation Technology
    • Data Source
      KAKENHI-PROJECT-20K11676
  • [Presentation] Power版次数制限除去問題の近似について2022

    • Author(s)
      迎 賢斗, 藤戸 敏弘
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K11676
  • [Presentation] Power版次数制限除去問題の近似について2022

    • Author(s)
      迎 賢斗, 藤戸 敏弘
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Presentation] 4辺支配集合問題の2倍近似アルゴリズム2021

    • Author(s)
      立松拓己,藤戸敏弘
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Presentation] 4辺支配集合問題の2倍近似アルゴリズム2021

    • Author(s)
      立松拓己,藤戸敏弘
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-20K11676
  • [Presentation] 補比較可能グラフ上の端点指定ハミルトン経路問題について2019

    • Author(s)
      宮澤寛巧, 藤戸敏弘
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Presentation] On Approximability of Connected Path Vertex Cover2017

    • Author(s)
      Fujito Toshihiro
    • Organizer
      15th Workshop on Approximation and Online Algorithms
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00013
  • [Presentation] On Approximability of Connected Path Vertex Cover2017

    • Author(s)
      Fujito Toshihiro
    • Organizer
      15th Workshop on Approximation and Online Algorithms
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330010
  • [Presentation] On Approximating (Connected) 2-Edge Dominating Set by a Tree2016

    • Author(s)
      T. Fujito, T. Shimoda
    • Organizer
      The 11th International Computer Science Symposium in Russia
    • Place of Presentation
      St. Petersburg, Russia
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-26330010
  • [Presentation] 初等的二部グラフで構成される木 における恒久的頂点被覆数につい て2012

    • Author(s)
      井上翔太, 荒木久, 藤戸敏弘
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      岐阜大学
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] Simple {1,2}-Edge Dominating Set Problem の近似解法2012

    • Author(s)
      津田大地, 藤戸敏弘
    • Organizer
      電気関係学会東海支部連合大会
    • Place of Presentation
      豊橋技術科学大学
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] Approximating Steiner Tree and Tree Cover Problems in Directed Graphs2012

    • Author(s)
      日比智也, 藤戸敏弘
    • Organizer
      冬のLAシンポジウム
    • Place of Presentation
      京都大学数理解析研究所
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] 携帯パケット通信料問題に対する オンラインアルゴリズム2012

    • Author(s)
      松田淳志, 藤原洋志, 藤戸敏弘
    • Organizer
      電気関係学会東海支部連合大会
    • Place of Presentation
      豊橋技術科学大学
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] 木状泥棒領域を持つグラフ護衛問 題の近似2011

    • Author(s)
      坂巻孝昌, 藤戸敏弘
    • Organizer
      電子情報通信学会技術研究報告, COMP2011-40
    • Place of Presentation
      名古屋大学
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] 携帯パケット通信料問題に対する オンラインアルゴリズム2011

    • Author(s)
      松田淳志, 藤原洋志, 藤戸敏弘
    • Organizer
      夏のLA シンポジウム
    • Place of Presentation
      ザヴィラ浜名湖
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] 単位円周上に対するアイテム配置 問題2011

    • Author(s)
      関孝洋, 藤原洋志, 藤戸敏弘
    • Organizer
      夏のLA シンポジウム
    • Place of Presentation
      ザヴィラ浜名湖
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] 最小コスト木状被覆問題の2倍近似アルゴリズム2006

    • Author(s)
      藤戸敏弘
    • Organizer
      情報処理学会 アルゴリズム研究会研究報告
    • Place of Presentation
      北海道大学(札幌市)
    • Year and Date
      2006-07-03
    • Description
      「研究成果報告書概要(和文)」より
    • Data Source
      KAKENHI-PROJECT-17500006
  • [Presentation] On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem

    • Author(s)
      Toshihiro Fujito
    • Organizer
      Scandinavian Symposium and Workshops on Algorithm Theory
    • Place of Presentation
      コペンハーゲン,デンマーク
    • Year and Date
      2014-07-02 – 2014-07-04
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] 連結2 辺支配集合問題の近似アルゴリズム

    • Author(s)
      下田知明,藤戸敏弘
    • Organizer
      2014 年度冬のLA シンポジウム
    • Place of Presentation
      京都
    • Year and Date
      2015-01-28 – 2015-01-30
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] Lower Bounds for the Multislope Ski-Rental Problem

    • Author(s)
      H. Fujiwara, Y. Konno, T. Fujito
    • Organizer
      The 11th International Symposium on Operations Research and its Applications (ISORA2013)
    • Place of Presentation
      中国、安徽省、黄山
    • Data Source
      KAKENHI-PROJECT-23500014
  • [Presentation] Online Weight Balancing on the Unit Circle

    • Author(s)
      H. Fujiwara, T. Seki, T. Fujito
    • Organizer
      The 16th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG2013)
    • Place of Presentation
      東京理科大
    • Data Source
      KAKENHI-PROJECT-23500014
  • 1.  FUJIWARA Hiroshi (80434893)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 8 results
  • 2.  HIRATA Tomio (10144205)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 3.  ONO Takao (60311718)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 4.  ISO Naoyuki (80283406)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 5.  和田 幸一 (90167198)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi