Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...
This is a preview. Log in through your library . Abstract We consider partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane. These ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results