Geometric Algorithms for Linear Programming (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)
スポンサーリンク
概要
- 論文の詳細を見る
Two computational-geometric approaches to linear programming are surveyed. One is based on the prune-and-search paradigm and the other utilizes randomization. These two techniques are quite useful to solve geometric problems efficiently, and have many other applications, some of which are also mentioned.
- 一般社団法人電子情報通信学会の論文
- 1993-03-25