Heuristic improvements for computing maximum multicommodity flow and minimum multicut

Authors:
Garima Batra;Naveen Garg;Garima Gupta
Affiliations:
Indian Institute of Technology Delhi, New Delhi, India;Indian Institute of Technology Delhi, New Delhi, India;Indian Institute of Technology Delhi, New Delhi, India
Venue:
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Year:
2005

Citing 4
Cited 1

Approximating Fractional Multicommodity Flow Independent of the Number of Commodities

SIAM Journal on Discrete Mathematics
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

SIAM Journal on Computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science

Content placement via the exponential potential function method

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose heuristics to reduce the number of shortest path computations required to compute a 1+ε approximation to the maximum multicommodity flow in a graph. Through a series of improvements we are able to reduce the number of shortest path computations significantly. One key idea is to use the value of the best multicut encountered in the course of the algorithm. For almost all instances this multicut is significantly better than that computed by rounding the linear program.