Randomized rounding algorithms for large scale unsplittable flow problems

Author name not available (Why is that?)

Publication date: 27 March 2023

Abstract: Unsplittable flow problems cover a wide range of telecommunication and transportation problems and their efficient resolution is key to a number of applications. In this work, we study algorithms that can scale up to large graphs and important numbers of commodities. We present and analyze in detail a heuristic based on the linear relaxation of the problem and randomized rounding. We provide empirical evidence that this approach is competitive with state-of-the-art resolution methods either by its scaling performance or by the quality of its solutions. We provide a variation of the heuristic which has the same approximation factor as the state-of-the-art approximation algorithm. We also derive a tighter analysis for the approximation factor of both the variation and the state-of-the-art algorithm. We introduce a new objective function for the unsplittable flow problem and discuss its differences with the classical congestion objective function. Finally, we discuss the gap in practical performance and theoretical guarantees between all the aforementioned algorithms.

Has companion code repository: https://github.com/sureli/randomized_rounding_paper_code

This page was built for publication: Randomized rounding algorithms for large scale unsplittable flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6431039)