Combinatorial algorithms for the unsplittable flow problem

DOI10.1007/S00453-005-1172-ZzbMath1092.68116OpenAlexW2001532889MaRDI QIDQ2492628

Yossi Azar, Oded Regev

Publication date: 14 June 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-005-1172-z

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Related Items (5)

On the disjoint paths problem ⋮ Maximum bipartite flow in networks with adaptive channel width ⋮ The Prize-collecting Call Control Problem on Weighted Lines and Rings ⋮ Routing in Undirected Graphs with Constant Congestion ⋮ Incentive compatible mulit-unit combinatorial auctions: a primal dual approach

This page was built for publication: Combinatorial algorithms for the unsplittable flow problem