Global optimization by local optimization with walks

• Project/Area Number: 22700019
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Single-year Grants
• Research Field: Fundamental theory of informatics
• Research Institution: Kyushu Sangyo University
• Principal Investigator: ASAHIRO Yuichi 九州産業大学, 情報科学部, 教授 (40304761)
• Project Period (FY): 2010 – 2012
• Project Status: Completed (Fiscal Year 2012)
• Budget Amount: ¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000); Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000); Fiscal Year 2011: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000); Fiscal Year 2010: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
• 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

• [Journal Article] Inapproximability of Maximum <i>r</i>-Regular Induced Connected Subgraph Problems (2013)
  • Author(s): Yuichi Asahiro, Hiroshi Eto, and EijiMiyano
  • Journal Title: IEICE Transactions on Information and Systems Volume: E96.D Issue: 3 Pages: 443-449
  • DOI: 10.1587/transinf.E96.D.443
  • NAID: 10031167429
  • ISSN: 0916-8532, 1745-1361
  • Peer Reviewed
• [Journal Article] NP-hardness of the Sorting Buffer Problem on the Uniform Metric (2012)
  • Author(s): Yuichi Asahiro, Kenichi Kawahara, and Eiji Miyano
  • Journal Title: Discrete Applied Mathematics Volume: Volume 160 Issue: 10-11 Pages: 1453-1464
  • DOI: 10.1016/j.dam.2012.02.005
  • NAID: 110006881039
  • 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)
  • Peer Reviewed
• [Journal Article] Graph Orientations Optimizing the Number of Light or Heavy Vertices (2012)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
  • Journal Title: ISCO 2012 Volume: Vol.7422 Pages: 332-343
  • DOI: 10.1007/978-3-642-32147-4_30
  • ISBN: 9783642321467, 9783642321474
  • 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
  • Peer Reviewed
• [Journal Article] Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty (2012)
  • Author(s): Y.Asahiro, J.Jansson, E.Miyano, H.Ono
  • Journal Title: Proc.Computing : The Australasian Theory Symposium (CATS 2012), Conferences in Research and Practice in Information Technology Volume: 128 Pages: 139-146
  • NAID: 120006654963
  • 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: 10.1007/978-3-642-22685-4_24
  • ISBN: 9783642226847, 9783642226854
  • 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 outdegree (2011)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo
  • Journal Title: J. Comb. Optim Volume: 22(1) Issue: 1 Pages: 78-96
  • DOI: 10.1007/s10878-009-9276-z
  • Peer Reviewed
• [Journal Article] Graph Orientation to Maximize the Minimum Weighted Outdegree (2011)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
  • Journal Title: Int. J. Found. Comput. Sci Volume: 22(3) Issue: 03 Pages: 583-601
  • DOI: 10.1142/s0129054111008246
  • NAID: 110007995568
  • Peer Reviewed
• [Journal Article] Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (2011)
  • Author(s): Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
  • Journal Title: Discrete Applied Mathematics Volume: 159(7) Issue: 7 Pages: 498-508
  • DOI: 10.1016/j.dam.2010.11.003
  • NAID: 120004951590
  • Peer Reviewed
• [Journal Article] Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems (2011)
  • Author(s): Y.Asahiro, H.Eto, E.Miyano
  • Journal Title: Proc.The 2011 International Conference on Foundations of Computer Science (FCS) Pages: 102-107
  • NAID: 10031167429
  • 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: 10.1007/978-3-642-12200-2_53
  • ISBN: 9783642121999, 9783642122002
  • Peer Reviewed
• [Journal Article] Approximating Maximum Diameter-Bounded Subgraphs (2010)
  • Author(s): Y.Asahiro, E.Miyano, K.Samizo
  • Journal Title: Proc.The 9th Latin American Theoretical Informatics Symposium, Lecture Notes in Computer Science Volume: 6034 Pages: 616-627
  • Peer Reviewed
• [Presentation] 弦グラフにおける直径限定部分グラフ最大化問題 (2013)
  • Author(s): 土井悠也
  • Organizer: 火の国情報シンポジウム2013
  • Place of Presentation: 熊本大
• [Presentation] 弦グラフにおける直径限定部分グラフ最大化問題 (2013)
  • Author(s): 朝廣雄一，土井悠也，宮野英次，志水宏宇
  • Organizer: 火の国情報シンポジウム2013
  • Place of Presentation: 熊本大学
• [Presentation] 次数を限定した平面グラフにおける誘導部分グラフ探索問題 (2012)
  • Author(s): 江藤宏
  • Organizer: 日本OR学会九州支部第3回九州地区における若手OR研究交流会
  • Place of Presentation: 北九州市立大
• [Presentation] 次数を限定した誘導部分グラフ探索問題 (2012)
  • Author(s): 江藤宏
  • Organizer: 2012年度夏のLAシンポジウム
  • Place of Presentation: 天橋立宮津ロイヤルホテル
• [Presentation] HardnessofRegularInducedConnectedSubgraphProblems (2012)
  • Author(s): HiroshiEto
  • Organizer: FifthAsianAssociationforAlgorithmsandComputationAnnualMeeting(AAAC12)
  • Place of Presentation: FudanUniversity,Shanghai,China
• [Presentation] W[1]-Hardness of Regular Induced Connected Subgraph Problems (2012)
  • Author(s): Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
  • Organizer: Fifth Asian Association for Algorithms and Computation Annual Meeting (AAAC12)
  • Place of Presentation: Fudan University, Shanghai, China
• [Presentation] 次数を限定した平面グラフにおける誘導部分グラフ探索問題 (2012)
  • Author(s): 江藤宏, 朝廣雄一, 伊藤健洋, 宮野英次
  • Organizer: 日本OR学会九州支部第3回九州地区における若手ＯＲ研究交流会
  • Place of Presentation: 北九州市立大学後援会館
• [Presentation] 次数を限定した誘導部分グラフ探索問題 (2012)
  • Author(s): 江藤宏, 朝廣雄一，伊藤健洋，宮野英次
  • Organizer: 2012年度夏のLAシンポジウム
  • Place of Presentation: 宮津ロイヤルホテル
• [Presentation] Improved Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems (2012)
  • Author(s): Yuichi Asahiro, Hiroshi Eto, and Eiji Miyano
  • Organizer: The 15th Japan-Korea Joint Workshop on Algorithms and Computation (WAAC 2012)
  • Place of Presentation: National Institute of Informatics
• [Presentation] Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation (2011)
  • Author(s): Hirotaka Ono
  • Organizer: 電子情報通信学会 コンピューテーション研究会
  • Place of Presentation: 名古屋大
  • Year and Date: 2011-12-16
• [Presentation] Minimizing Penalty on Upper and Lower Degree Constrained Graph Orientation (2011)
  • Author(s): Yuichi Asahiro, Jesper Jansson, Eiji Miyano, 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] 資源増加を許した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-09-06
• [Presentation] 頂点数を最大とする正則誘導連結部分グラフ問題の計算複雑さ (2011)
  • Author(s): 江藤宏
  • Organizer: 電子情報通信学会コンピューテーション研究会
  • Place of Presentation: 広島大
  • Year and Date: 2011-06-30
• [Presentation] 頂点数を最大とする正則誘導連結部分グラフ問題の計算複雑さ (2011)
  • Author(s): 朝廣雄一, 江藤宏, 宮野英次
  • Organizer: 電子情報通信学会コンピューテーション研究会
  • Place of Presentation: 広島大学(広島県)
  • Year and Date: 2011-06-30
• [Presentation] 2-Competitive Algorithm for Online OVSF Code Assignment with Small Resource Augmentation (2011)
  • Author(s): Yuichi Asahiro, Kenta Kanmera, Eiji Miyano
  • Organizer: The 4th Annual Meeting of Asian Association for Algorithms and Computation
  • Place of Presentation: National Tsing Hua University (Hsinchu, Taiwan)
  • Year and Date: 2011-04-17
• [Presentation] 資源増加を許したOVSF符号割当問題に対する2競合アルゴリズム (2011)
  • Author(s): 朝廣雄一
  • Organizer: 情報処理学会アルゴリズム研究会
  • Place of Presentation: 琉球大
  • Year and Date: 2011-03-07
• [Presentation] 資源増加を許したOVSF符号割当問題に対する2競合アルゴリズム (2011)
  • Author(s): 朝廣雄一, 上米良謙太, 宮野英次
  • Organizer: 情報処理学会 アルゴリズム研究会
  • Place of Presentation: 琉球大学
  • Year and Date: 2011-03-07
• [Presentation] 2-Competitive Algorithm for Online OVSF Code Assignment with Small Resource Augmentation (2011)
  • Author(s): Yuichi Asahiro
  • Organizer: The 4th Annual Meeting of Asian Association for Algorithms and Computation
  • Place of Presentation: National Tsing Hua University, Taiwan
• [Presentation] オンラインOVSF符号割当問題のリソースと競合比 (2010)
  • Author(s): 上米良謙太
  • Organizer: 電子情報通信学会九州支部学生会講演会
  • Place of Presentation: 福岡工業大
  • Year and Date: 2010-09-24
• [Presentation] オンラインOVSF符号割当問題のリソースと競合比 (2010)
  • Author(s): 上米良謙太, 朝廣雄一, 宮野英次
  • Organizer: 電子情報通信学会九州支部学生会講演会
  • Place of Presentation: 福岡工業大学
  • Year and Date: 2010-09-24
• [Remarks] 研究成果リスト
  • URL: http://www.is.kyusan-u.ac.jp/~asahiro/research/publication.html