Approximation algorithms for the unsplittable flow problem

DOI10.1007/S00453-006-1210-5zbMATH Open1107.68120OpenAlexW2104685111MaRDI QIDQ868438FDOQ868438

Authors: Amit Chakrabarti, Chandra Chekuri, Amit Kumar, Anupam Gupta 

Publication date: 5 March 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Approximation_Algorithms_for_the_Unsplittable_Flow_Problem/6603611

Recommendations

• scientific article; zbMATH DE number 1947047
• Approximation algorithms for the unsplittable flow problem on paths and trees
• Approximation algorithms for single-source unsplittable flow
• Implementing approximation algorithms for the single-source unsplittable flow problem
• Combinatorial algorithms for the unsplittable flow problem
• New Algorithms for the Unsplittable Flow Problem
• Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
• A constant-factor approximation algorithm for unsplittable flow on paths
• A constant factor approximation algorithm for unsplittable flow on paths
• Improved bounds for the unsplittable flow problem

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cited In (40)

• Scheduling split intervals with non-uniform demands
• Stochastic makespan minimization in structured set systems (extended abstract)
• Combinatorial approximation algorithms for generalized flow problems
• Improved bounds for the unsplittable flow problem
• A note on the greedy algorithm for the unsplittable flow problem
• Algebraic theory on shortest paths for all flows
• Maximum bipartite flow in networks with adaptive channel width
• A quasi-PTAS for unsplittable flow on line graphs
• Stochastic makespan minimization in structured set systems
• Stochastic unsplittable flows
• Improved algorithms for resource allocation under varying capacity
• Scheduling Resources for Throughput Maximization
• A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
• Packing cars into narrow roads: PTASs for limited supply highway
• Title not available (Why is that?)
• Pricing on paths: a PTAS for the highway problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The \(k\)-splittable flow problem
• The prize-collecting call control problem on weighted lines and rings
• A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints
• Optimal interval scheduling with a resource constraint
• Approximation algorithms for the unsplittable flow problem on paths and trees
• Combinatorial algorithms for the unsplittable flow problem
• NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
• A logarithmic approximation for unsplittable flow on line graphs
• Submodular unsplittable flow on trees
• Submodular unsplittable flow on trees
• Resource allocation with time intervals
• Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
• On the single-source unsplittable flow problem
• Title not available (Why is that?)
• Improved algorithms for scheduling unsplittable flows on paths
• Title not available (Why is that?)
• Approximations for generalized unsplittable flow on paths with application to power systems optimization
• Meet and merge: approximation algorithms for confluent flows
• Algebraic theory on shortest paths for all flows
• Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
• A constant factor approximation algorithm for the storage allocation problem

This page was built for publication: Approximation 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 Q868438)