A Faster Algorithm for the Minimum Capacity Cut Problem of Undirected Networks
スポンサーリンク
概要
著者
-
小野 正
京都大学工学部数理工学教室
-
茨木 俊秀
Department of Applied Mathematics and Physics, Graduate School of Engineering, Kyoto University
-
永持 仁
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University
-
小野 正
Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University
-
永持 仁
Department Of Applied Mathematics And Physics Graduate School Of Informatics Kyoto University
関連論文
- Tabu Search Approach to CSP (Constraint Satisfaction Problem) as a General Problem Solver(Continuous and Discrete Mathematical Optimization)
- Single Vehicle Scheduling Problem for Processing a Maximum Benefit Subset of Jobs on a Line(New Trends in Theory of Computation and Algorithm)
- Offer Analysis for the Arbitration Procedure FDOA(MATHEMATICAL OPTIMIZATION AND ITS APPLICATIONS)
- Intrinsic Gap and Final-Double-Offer Arbitration
- 最小容量カットアルゴリズムのプログラムによる効率の良い実現法
- A Faster Algorithm for the Minimum Capacity Cut Problem of Undirected Networks
- 無向ネットワークの最小カットを求める実用的高速アルゴリズム(グラフ・ネットワーク)
- Optimization-Based Iterative Methods for Solving Nonlinear Complementarity Problems(Nonlinear Analysis and Mathematical Economics)
- Some Duality Properties of Combinatorial Optimization Games(Optimization Theory in Descrete and Continuous Mathematical Sciences)
- Optimization Games on Graphs(Continuous and Discrete Mathematical Optimization)
- 正論理関数の最大潜伏度の同定(計算量理論)