A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
Packing a trunk: now with a twist!
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Approximation algorithms for the weighted independent set problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.