A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximating rational objectives is as easy as approximating linear ones
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Verifying nash equilibria in pagerank games on undirected web graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Approximate binary search algorithms for mean cuts and cycles
Operations Research Letters
A fast bipartite network flow algorithm for selective assembly
Operations Research Letters
ε-Approximation minimization of convex functions in fixed dimension
Operations Research Letters
Supervised assessment of segmentation hierarchies
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
Reputation games for undirected graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.