Proceedings., 33rd Annual Symposium on Foundations of Computer Science (1992)

Pittsburgh, PA, USA

Oct. 24, 1992 to Oct. 27, 1992

ISBN: 0-8186-2900-2

pp: 659-669

T. Radzik , Stanford Univ., CA, USA

ABSTRACT

The authors considers Newton's method for the linear fractional combinatorial optimization. He proves a strongly polynomial bound on the number of iterations for the general case. He considers the maximum mean-weight cut problem, which is a special case of the linear fractional combinatorial optimization. This problem is closely related to the parametric flow problem and the flow problem when the maximum arc cost is being minimised. He proves that Newton's method runs in O(m) iterations for the maximum mean-weight cut problem. One iteration is dominated by the maximum flow computation. This gives the best known strongly polynomial bound of O(m/sup 2/n) for all three problems mentioned.

INDEX TERMS

maximum arc cost, Newton method, spanning trees, geometry, fractional combinatorial optimization, strongly polynomial bound, iterations, maximum mean-weight cut problem, parametric flow problem

CITATION

T. Radzik, "Newton's method for fractional combinatorial optimization,"

*Proceedings., 33rd Annual Symposium on Foundations of Computer Science(FOCS)*, Pittsburgh, PA, USA, 1992, pp. 659-669.

doi:10.1109/SFCS.1992.267785

CITATIONS

SEARCH