scientific article; zbMATH DE number 6850331

zbMATH Open1403.68342MaRDI QIDQ4607900FDOQ4607900

Authors: Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu 

Publication date: 15 March 2018

Full work available at URL: http://dl.acm.org/citation.cfm?id=3175289

Title of this publication is not available (Why is that?)

Recommendations

• Algorithms to approximate column-sparse packing problems
• On \(k\)-column sparse packing programs
• Parameterized approximation algorithms for packing problems
• scientific article; zbMATH DE number 1830745
• Efficient algorithms for orthogonal packing problems
• Approximation schemes for ordered vector packing problems
• scientific article; zbMATH DE number 1833403
• Approximation schemes for multidimensional packing
• Approximating low-congestion routing and column-restricted packing problems
• scientific article; zbMATH DE number 1183280

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Integer programming (90C10)

Cited In (4)

• Scheduling split intervals with non-uniform demands
• Column basis reduction and decomposable knapsack problems
• Approximating low-congestion routing and column-restricted packing problems
• On \(k\)-column sparse packing programs

This page was built for publication:

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