scientific article; zbMATH DE number 6850331

MaRDI QIDQ4607900zbMATH OpenFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(6)

• On \(k\)-column sparse packing programs
• Algorithms to approximate column-sparse packing problems
• Solving packing integer programs via randomized rounding with alterations
• Approximating low-congestion routing and column-restricted packing problems
• Column basis reduction and decomposable knapsack problems
• Scheduling split intervals with non-uniform demands

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)