Combinatorial algorithms for the unsplittable flow problem

DOI10.1007/S00453-005-1172-ZMaRDI QIDQ2492628zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Approximation algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 1947047
• New Algorithms for the Unsplittable Flow Problem
• scientific article; zbMATH DE number 108290
• Approximation algorithms for the unsplittable flow problem on paths and trees
• scientific article; zbMATH DE number 1775441
• scientific article; zbMATH DE number 1757944
• Combinatorial approximation algorithms for generalized flow problems
• A note on the greedy algorithm for the unsplittable flow problem
• The \(k\)-splittable flow problem

Cited in

(20)

• A note on the greedy algorithm for the unsplittable flow problem
• Combinatorial approaches to multiflow problems
• On the single-source unsplittable flow problem
• Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
• On the disjoint paths problem
• Approximations for generalized unsplittable flow on paths with application to power systems optimization
• Combinatorial approximation algorithms for generalized flow problems
• The prize-collecting call control problem on weighted lines and rings
• Routing in undirected graphs with constant congestion
• A quasi-PTAS for unsplittable flow on line graphs
• Combinatorial Algorithms for the Generalized Circulation Problem
• Improved bounds for the unsplittable flow problem
• New Algorithms for the Unsplittable Flow Problem
• Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
• scientific article; zbMATH DE number 1947047 (Why is no real title available?)
• scientific article; zbMATH DE number 1757944 (Why is no real title available?)
• Stochastic unsplittable flows
• Maximum bipartite flow in networks with adaptive channel width
• The \(k\)-splittable flow problem
• Approximation algorithms for the unsplittable flow problem

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

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