Approximating low-congestion routing and column-restricted packing problems

DOI10.1016/S0020-0190(00)00033-8zbMath1014.68226MaRDI QIDQ1607041

Aravind Srinivasan, Alok Baveja

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

column-sparse integer programs

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation algorithms (68W25)

Related Items (2)

Approximating covering integer programs with multiplicity constraints ⋮ Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Cites Work

• Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item

This page was built for publication: Approximating low-congestion routing and column-restricted packing problems