Algorithms for Submodular Flows(Special Issue on Algorithm Engineering : Surveys)
スポンサーリンク
概要
- 論文の詳細を見る
We first describe fundamental results about submodular functions and submodular flows, which lay a basis for devising efficient algorithms for submodular flows. We then give a comprehensive survey on algorithms for submodular flows and show some possible future research directions.
- 社団法人電子情報通信学会の論文
- 2000-03-25
著者
-
Fujishige Satoru
Division of Systems Science Department of Systems and Human Science Graduate School of Enginecring S
-
Fujishige Satoru
Division Of Systems Science Graduate School Of Engineering Science Osaka University
-
Iwata S
Division Of Systems Science Graduate School Of Engineering Science Osaka University
-
IWATA Satoru
Division of Systems Science, Graduate School of Engineering Science, Osaka University
関連論文
- BALANCED BISUBMODULAR SYSTEMS AND BIDIRECTED FLOWS
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER A FINITE JUMP SYSTEM
- A GREEDY ALGORITHM FOR MINIMIZING A SEPARABLE CONVEX FUNCTION OVER AN INTEGRAL BISUBMODULAR POLYHEDRON
- A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS
- Optimal Sink Location Problem for Dynamic Flows in a Tree Network(Special Section on Discrete Mathematics and Its Applications)
- 劣モジュラ関数最小化のアルゴリズム:ブレイクスルーと周辺の話題 (特集 アルゴリズムの新展開--理論から工学へ)
- ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION
- Algorithms for Submodular Flows(Special Issue on Algorithm Engineering : Surveys)