Approximating the Orthogonal Knapsack Problem for Hypercubes

DOI10.1007/11786986_22zbMath1223.90052OpenAlexW1597002493MaRDI QIDQ3613763

Rolf Harren

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_22

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Rectangle packing with one-dimensional resource augmentation ⋮ A Polynomial Time Approximation Scheme for the Square Packing Problem ⋮ Approximation algorithms for orthogonal packing problems for hypercubes

This page was built for publication: Approximating the Orthogonal Knapsack Problem for Hypercubes