For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Geometric Algorithms for Linear Programming
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/03/25
Print ISSN: 0916-8508
Type of Manuscript: INVITED PAPER (Special Section on the 5th Karuizawa Workshop on Circuits and Systems)
computational geometry, linear programming, prune-and-search, randomization,
Full Text: PDF>>
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.