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

2012 Fiscal Year Final Research Report

Global optimization by local optimization with walks

Research Project

  • PDF
Project/Area Number 22700019
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionKyushu Sangyo University

Principal Investigator

ASAHIRO Yuichi  九州産業大学, 情報科学部, 教授 (40304761)

Project Period (FY) 2010 – 2012
Keywords組み合わせ最適化 / アルゴリズム / 近似 / 計算複雑さ
Research Abstract

We designed algorithms and considered computational complexity for some combinatorial optimization problems, where we utilize a type of algorithms which traverses a graph structure and compute based on local information.

  • Research Products

    (22 results)

All 2013 2012 2011 2010

All Journal Article (11 results) (of which Peer Reviewed: 11 results) Presentation (11 results)

  • [Journal Article] Inapproximability of Maximumr-Regular Induced Connected SubgraphProblems2013

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and EijiMiyano
    • Journal Title

      IEICE Transactions onInformation and Systems

      Volume: Vol. E96-D,No.3 Pages: 443-449

    • DOI

      DOI:10.1587/transinf.E96.D.443

    • Peer Reviewed
  • [Journal Article] NP-hardness of the Sorting Buffer Problem on the Uniform Metric2012

    • Author(s)
      Yuichi Asahiro, Kenichi Kawahara, and Eiji Miyano
    • Journal Title

      Discrete Applied Mathematics

      Volume: Volume 160 Pages: 1453-1464

    • DOI

      DOI: 10.1016/j.dam.2012.02.005

    • Peer Reviewed
  • [Journal Article] Improved Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems, Proc.2012

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    • Journal Title

      The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012)

      Pages: 161--168

    • Peer Reviewed
  • [Journal Article] Graph Orientations Optimizing the Number of Light or Heavy Vertices, Proc.2012

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      2nd International Symposium on Combinatorial Optimization (ISCO2012), Lecture Notes in ComputerScience

      Volume: Vol.7422 Pages: 332--343

    • DOI

      DOI: 10.1007/978-3-642-32147-4_30

    • Peer Reviewed
  • [Journal Article] Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty, Proc. Computing: The Australasian Theory Symposium (CATS 2012)2012

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      Conferences in Research and Practice in Information Technology

      Volume: Vol.128 Pages: 139-146

    • URL

      URL: http://crpit.com/abstracts/CRPITV128Asahiro.html

    • Peer Reviewed
  • [Journal Article] Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation, Proc.2011

    • Author(s)
      Yuichi Asahiro, Kenta Kanmera, and Eiji Miyano
    • Journal Title

      17th Annual International Conference on Computing and Combinatorics (COCOON 2011), Lecture Notes in Computer Science

      Volume: Vol.6842 Pages: 259-270

    • DOI

      DOI: 10.1007/978-3-642-22685-4_24

    • Peer Reviewed
  • [Journal Article] Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems, Proc.2011

    • Author(s)
      Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
    • Journal Title

      The 2011 InternationalConference on Foundations of Computer Science (FCS)

      Pages: 102-107

    • Peer Reviewed
  • [Journal Article] Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree2011

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, and Kouhei Zenmyo
    • Journal Title

      Jounal of Combinatorial Optimization

      Volume: Vol.22, No.1 Pages: 78-96

    • DOI

      DOI: 10.1007/s10878-009-9276-z

    • Peer Reviewed
  • [Journal Article] Graph Orientation to Maximize the Minimum Weighted Outdegree2011

    • Author(s)
      Yuichi Asahiro, Jesper Jansson, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      International Journal of Foundations of Computer Science

      Volume: Vol.22, No.3 Pages: 583-601

    • DOI

      DOI: 10.1142/S0129054111008246

    • Peer Reviewed
  • [Journal Article] Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree2011

    • Author(s)
      Yuichi Asahiro, Eiji Miyano, and Hirotaka Ono
    • Journal Title

      Discrete Applied Mathematics

      Volume: Vol.159, No.7 Pages: 498-508

    • DOI

      DOI: 10.1016/j.dam.2010.11.003

    • Peer Reviewed
  • [Journal Article] Approximating Maximum Diameter-Bounded Subgraphs, Proc.2010

    • Author(s)
      Yuichi Asahiro, Eiji Miyano, and Kazuaki Samizo
    • Journal Title

      The9th Latin American Theoretical Informatics Symposium (LATIN), Lecture Notes in Computer Science

      Volume: Vol.6034 Pages: 616-627

    • DOI

      DOI: 10.1007/978-3-642-12200-2_53

    • Peer Reviewed
  • [Presentation] 弦グラフにおける直径限定部分グラフ最大化問題2013

    • Author(s)
      土井悠也
    • Organizer
      火の国情報シンポジウム2013
    • Place of Presentation
      熊本大
    • Year and Date
      20130314-0315
  • [Presentation] 次数を限定した平面グラフにおける誘導部分グラフ探索問題2012

    • Author(s)
      江藤宏
    • Organizer
      日本OR学会九州支部第3回九州地区における若手OR研究交流会
    • Place of Presentation
      北九州市立大
    • Year and Date
      20121027-1028
  • [Presentation] 次数を限定した誘導部分グラフ探索問題2012

    • Author(s)
      江藤宏
    • Organizer
      2012年度夏のLAシンポジウム
    • Place of Presentation
      天橋立宮津ロイヤルホテル
    • Year and Date
      20120717-0719
  • [Presentation] HardnessofRegularInducedConnectedSubgraphProblems2012

    • Author(s)
      HiroshiEto
    • Organizer
      FifthAsianAssociationforAlgorithmsandComputationAnnualMeeting(AAAC12)
    • Place of Presentation
      FudanUniversity,Shanghai,China
    • Year and Date
      20120421-0422
  • [Presentation] 2-Competitive Algorithm for Online OVSF Code Assignment with Small Resource Augmentation2011

    • Author(s)
      Yuichi Asahiro
    • Organizer
      The 4th Annual Meeting of Asian Association for Algorithms and Computation
    • Place of Presentation
      National Tsing Hua University, Taiwan
    • Year and Date
      20110416-0417
  • [Presentation] Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation2011

    • Author(s)
      Hirotaka Ono
    • Organizer
      電子情報通信学会 コンピューテーション研究会
    • Place of Presentation
      名古屋大
    • Year and Date
      2011-12-16
  • [Presentation] 資源増加を許したOVSF符号割当問題に対する(1+ε)-競合アルゴリズム2011

    • Author(s)
      朝廣雄一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      山口大
    • Year and Date
      2011-11-18
  • [Presentation] 最大正則連結部分グラフ問題のパラメータ化計算量2011

    • Author(s)
      江藤宏
    • Organizer
      電子情報通信学会九州支部学生会講演会
    • Place of Presentation
      佐賀大
    • Year and Date
      2011-09-28
  • [Presentation] 頂点数を最大とする正則誘導連結部分グラフ問題の計算複雑さ2011

    • Author(s)
      江藤宏
    • Organizer
      電子情報通信学会コンピューテーション研究会
    • Place of Presentation
      広島大
    • Year and Date
      2011-06-30
  • [Presentation] 資源増加を許したOVSF符号割当問題に対する2競合アルゴリズム2011

    • Author(s)
      朝廣雄一
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      琉球大
    • Year and Date
      2011-03-07
  • [Presentation] オンラインOVSF符号割当問題のリソースと競合比2010

    • Author(s)
      上米良謙太
    • Organizer
      電子情報通信学会九州支部学生会講演会
    • Place of Presentation
      福岡工業大
    • Year and Date
      2010-09-24

URL: 

Published: 2014-08-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi