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

Designing Algorithms for Network Analysis with Combinatorial Optimization Theory

Research Project

Project/Area Number 17K00028
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Mathematical informatics
Research InstitutionKeio University

Principal Investigator

Kakimura Naonori  慶應義塾大学, 理工学部(矢上), 准教授 (30508180)

Project Period (FY) 2017-04-01 – 2023-03-31
Project Status Completed (Fiscal Year 2022)
Budget Amount *help
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2020: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2017: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Keywords組合せ最適化 / アルゴリズム / 近似アルゴリズム / ストリーミング計算 / 離散構造 / 劣モジュラ関数 / ストリーミングアルゴリズム / マトロイド / マッチング / コミュニティ検出 / 数理工学 / 情報基礎 / 数理モデル
Outline of Final Research Achievements

In this project, we proposed combinatorial optimization models for large-scale network analysis, and designed efficient algorithms with theoretical guarantees for the proposed models. In particular, we investigated the computational complexity and approximability of streaming algorithms for the problem of maximizing submodular functions with some constraints, and proposed new optimization models for the community detection problem in networks. These problems are general optimization problems that have been studied widely in theory and practice. Our results have been presented in refereed conferences in theoretical computer science and data mining, and published in international refereed journals.

Academic Significance and Societal Importance of the Research Achievements

本研究課題では,組合せ最適化手法を用いて,ネットワークを解析するための汎用的なモデルと効率的な計算手法を確立することを目指した.研究成果は,ネットワーク解析という実用に現れる問題に対して,組合せ最適化という理論的な手法を用いてアプローチするものであり,理論と実用の両面からの有用性が期待される.近年,機械学習や人工知能など情報科学分野ではアルゴリズムの理論的な性質を保証することが重要となっており,組合せ最適化理論を用いた本研究のアプローチは国際的な研究動向に沿った研究成果と言える.また,フランス,アメリカ,ハンガリーなどの研究者と連携し研究を行なうことで,国際的な研究ネットワークを構築した.

Report

(7 results)
  • 2022 Annual Research Report   Final Research Report ( PDF )
  • 2021 Research-status Report
  • 2020 Research-status Report
  • 2019 Research-status Report
  • 2018 Research-status Report
  • 2017 Research-status Report
  • Research Products

    (55 results)

All 2023 2022 2021 2020 2019 2018 2017 Other

All Int'l Joint Research (14 results) Journal Article (30 results) (of which Int'l Joint Research: 13 results,  Peer Reviewed: 30 results,  Open Access: 12 results) Presentation (10 results) (of which Int'l Joint Research: 3 results,  Invited: 2 results) Remarks (1 results)

  • [Int'l Joint Research] Ecole Normale Superieure(フランス)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] Eotvos Lorand University(ハンガリー)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] Technical University of Munich(ドイツ)

    • Related Report
      2022 Annual Research Report
  • [Int'l Joint Research] Ecole Normale Superieure/IRIF(フランス)

    • Related Report
      2021 Research-status Report
  • [Int'l Joint Research] Eotvos Lorand University(ハンガリー)

    • Related Report
      2021 Research-status Report
  • [Int'l Joint Research] Technical University of Munich(ドイツ)

    • Related Report
      2021 Research-status Report
  • [Int'l Joint Research] Ecole Normale Superieure(フランス)

    • Related Report
      2020 Research-status Report
  • [Int'l Joint Research] Eotvos Lorand University(ハンガリー)

    • Related Report
      2020 Research-status Report
  • [Int'l Joint Research] University of Illinois, Urbana-Champaign/University of Colorado Boulder/Duke University(米国)

    • Related Report
      2020 Research-status Report
  • [Int'l Joint Research] Ecole Normale Superieure(フランス)

    • Related Report
      2019 Research-status Report
  • [Int'l Joint Research] Boston University(米国)

    • Related Report
      2019 Research-status Report
  • [Int'l Joint Research] Ecole Normale Suprieure(フランス)

    • Related Report
      2018 Research-status Report
  • [Int'l Joint Research] Ecole Normale Suprieure(フランス)

    • Related Report
      2017 Research-status Report
  • [Int'l Joint Research]

    • Related Report
      2017 Research-status Report
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 19 Issue: 1 Pages: 6-6

    • DOI

      10.1145/3561302

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 36 Issue: 2 Pages: 1102-1123

    • DOI

      10.1137/20m1364370

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Operations Research Letters

      Volume: 50 Issue: 3 Pages: 370-375

    • DOI

      10.1016/j.orl.2022.05.001

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model2022

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 36 Issue: 1 Pages: 355-382

    • DOI

      10.1137/20m1357317

    • Related Report
      2021 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Online Task Assignment Problems with Reusable Resources2022

    • Author(s)
      Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      The 36th AAAI Conference on Artificial Intelligence (AAAI)

      Volume: --

    • Related Report
      2021 Research-status Report
    • Peer Reviewed
  • [Journal Article] Reforming an Envy-Free Matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki
    • Journal Title

      The 36th AAAI Conference on Artificial Intelligence (AAAI)

      Volume: --

    • Related Report
      2021 Research-status Report
    • Peer Reviewed
  • [Journal Article] Monotone Edge Flips to an Orientation of Maximum Edge-connectivity \`a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      The ACM-SIAM Symposium on Discrete Algorithms(SODA)

      Volume: --

    • Related Report
      2021 Research-status Report
    • Peer Reviewed
  • [Journal Article] Market Pricing for Matroid Rank Valuations2021

    • Author(s)
      Kristof Berczi, Naonori Kakimura, Yusuke Kobayashi
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 35 Issue: 4 Pages: 2662-2678

    • DOI

      10.1137/20m1386335

    • Related Report
      2021 Research-status Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization2021

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura
    • Journal Title

      Theory of Computing Systems

      Volume: 66 Issue: 1 Pages: 354-394

    • DOI

      10.1007/s00224-021-10065-6

    • Related Report
      2021 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Dynamic Bipartite Matching Market with Arrivals and Departures2021

    • Author(s)
      Naonori Kakimura, Donghao Zhu
    • Journal Title

      The 17th Conference on Web and Internet Economics (WINE 2021)

      Volume: --

    • Related Report
      2021 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2021

    • Author(s)
      Chien-Chung Huang and Naonori Kakimura
    • Journal Title

      Algorithmica

      Volume: 83 Issue: 3 Pages: 879-902

    • DOI

      10.1007/s00453-020-00786-4

    • Related Report
      2020 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Submodular Reassignment Problem for Reallocating Agents to Tasks with Synergy Effects2021

    • Author(s)
      Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Discrete Optimization

      Volume: to appear Pages: 100631-100631

    • DOI

      10.1016/j.disopt.2021.100631

    • Related Report
      2020 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Spectral Aspects of Symmetric Matrix Signings2020

    • Author(s)
      Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, and Alexandra Kolla
    • Journal Title

      Discrete Optimization

      Volume: 37 Pages: 100582-100582

    • DOI

      10.1016/j.disopt.2020.100582

    • Related Report
      2020 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Complexity of the Multi-Service Center Problem2020

    • Author(s)
      Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi
    • Journal Title

      Theoretical Computer Science

      Volume: 842 Pages: 18-27

    • DOI

      10.1016/j.tcs.2020.07.021

    • Related Report
      2020 Research-status Report
    • Peer Reviewed
  • [Journal Article] Market Pricing for Matroid Rank Valuations2020

    • Author(s)
      Kristof Berczi, Naonori Kakimura, and Yusuke Kobayashi
    • Journal Title

      The 31st International Symposium on Algorithms and Computation (ISAAC 2020)

      Volume: 39 Pages: 1-15

    • Related Report
      2020 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2020

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida
    • Journal Title

      Algorithmica

      Volume: 82 Issue: 4 Pages: 1006-1032

    • DOI

      10.1007/s00453-019-00628-y

    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] The b-branching problem in digraphs2020

    • Author(s)
      Naonori Kakimura, Naoyuki Kamiyama and Kenjiro Takazawa
    • Journal Title

      Discrete Applied Mathematics

      Volume: - Pages: 565-576

    • DOI

      10.1016/j.dam.2020.02.005

    • Related Report
      2019 Research-status Report
    • Peer Reviewed
  • [Journal Article] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2019

    • Author(s)
      Chien-Chung Huang and Naonori Kakimura
    • Journal Title

      The Algorithms and Data Structures Symposium (WADS), LNCS

      Volume: 11646 Pages: 438-451

    • DOI

      10.1007/978-3-030-24766-9_32

    • ISBN
      9783030247652, 9783030247669
    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries2019

    • Author(s)
      Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, and Jakub Pachocki
    • Journal Title

      The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2019)

      Volume: -

    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Spectral Aspects of Symmetric Matrix Signings2019

    • Author(s)
      Charlie Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura and Alexandra Kolla
    • Journal Title

      The 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), LIPIcs

      Volume: 81 Pages: 1-13

    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Shortest Reconfiguration of Perfect Matchings via Alternating Cycles2019

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      The 27th Annual European Symposium on Algorithms (ESA 2019), LIPIcs

      Volume: 61 Pages: 1-15

    • Related Report
      2019 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Reconfiguration of maximum-weight b-matchings in a graph2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 37 Issue: 2 Pages: 454-464

    • DOI

      10.1007/s10878-018-0289-3

    • NAID

      120006960832

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Exact and Approximation Algorithms for Weighted Matroid Intersection2018

    • Author(s)
      Chen-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama
    • Journal Title

      Mathematical Programming

      Volume: -

    • Related Report
      2018 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Algorithmica

      Volume: 81 Issue: 1 Pages: 343-366

    • DOI

      10.1007/s00453-018-0448-z

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Journal Article] Finding a Dense Subgraph with Sparse Cut2018

    • Author(s)
      Atsushi Miyauchi and Naonori Kakimura
    • Journal Title

      Proceedings of the 27th ACM International Conference on Information and Knowledge Management (CIKM 2018)

      Volume: - Pages: 547-556

    • DOI

      10.1145/3269206.3271720

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Journal Article] The b-Branching Problem in Digraphs2018

    • Author(s)
      Naonori Kakimura, Naoyuki Kamiyama, and Kenjiro Takazawa
    • Journal Title

      The 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)

      Volume: -

    • Related Report
      2018 Research-status Report
    • Peer Reviewed
  • [Journal Article] Tight approximability of the server allocation problem for real-time applications2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada
    • Journal Title

      Proceedings of 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017)

      Volume: --- Pages: 41-55

    • DOI

      10.1007/978-3-319-74875-7_4

    • NAID

      120006998850

    • ISBN
      9783319748740, 9783319748757
    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2017

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida
    • Journal Title

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)

      Volume: 81

    • DOI

      10.4230/LIPIcs.APPROX-RANDOM.2017.11

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)

      Volume: --- Pages: 287-296

    • DOI

      10.1007/978-3-319-62389-4_24

    • NAID

      120006960832

    • ISBN
      9783319623887, 9783319623894
    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Complexity of the Multi-Service Center Problem2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kobayashi Yusuke
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.48

    • Related Report
      2017 Research-status Report
    • Peer Reviewed / Open Access
  • [Presentation] Matching in Bipartite Graphs with Stochastic Arrivals and Departures2023

    • Author(s)
      Naonori Kakimura
    • Organizer
      12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research / Invited
  • [Presentation] ストリーミングデータにおけるアイテム頻出数を求める省領域乱択アルゴリズム2022

    • Author(s)
      垣村尚徳,新田陸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Related Report
      2022 Annual Research Report
  • [Presentation] Reformist Envy-Free Item Allocations: Algorithms and Complexity2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      第183回情報処理学会アルゴリズム研究会
    • Related Report
      2021 Research-status Report
  • [Presentation] マトロイドランク効用関数をもつ組合せ市場の価格付け2021

    • Author(s)
      Berczi Kristof,垣村 尚徳,小林 佑輔
    • Organizer
      日本応用数理学会 2021年 研究部会連合発表会
    • Related Report
      2020 Research-status Report
  • [Presentation] 大規模ネットワーク解析のための組合せ最適化アルゴリズム2019

    • Author(s)
      垣村尚徳
    • Organizer
      第32回回路とシステムワークショップ
    • Related Report
      2019 Research-status Report
    • Invited
  • [Presentation] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2019

    • Author(s)
      垣村尚徳,Chien-Chung Huang
    • Organizer
      情報処理学会第174回アルゴリズム研究会
    • Related Report
      2019 Research-status Report
  • [Presentation] Complexity of the Multi-Service Center Problem2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura and Yusuke Kobayashi
    • Organizer
      The Japanese Conference on Combinatorics and Its Applications (JCCA 2018)
    • Related Report
      2018 Research-status Report
    • Int'l Joint Research
  • [Presentation] Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization2018

    • Author(s)
      垣村尚徳,Chien-Chung Huang,
    • Organizer
      情報処理学会第170回アルゴリズム研究会
    • Related Report
      2018 Research-status Report
  • [Presentation] 対称行列の符号付けとグラフスペクトル2018

    • Author(s)
      Carlson Charles, Chandrasekaran Karthekeyan, Chang Hsien-Chih, 垣村尚徳, Kolla Alexandra
    • Organizer
      日本応用数理学会2018年第14回研究部会連合発表会
    • Related Report
      2017 Research-status Report
  • [Presentation] Streaming Submodular Maximization under a Knapsack Constraint2017

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida
    • Organizer
      The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Related Report
      2017 Research-status Report
    • Int'l Joint Research
  • [Remarks]

    • URL

      http://www.math.keio.ac.jp/~kakimura/index-j.html

    • Related Report
      2017 Research-status Report

URL: 

Published: 2017-04-28   Modified: 2024-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi