TR#: | CS0913 |

Class: | CS |

Title: | Constant Absolute Error Approximation Algorithm for the ``Safe Deposit Boxes'' Problem |

Authors: | Yefim Dinitz |

CS0913.pdf | |

PDF - Revised | CS0913.revised.pdf |

Abstract: | Suppose there are $n$ safe deposit boxes, each containing known amounts of $m$ currencies, and there is a certain need for these currencies. The problem is how to open the minimal number of boxes in order to collect at least the prescribed amount of each currency. This problem is proved to be NP-hard. For the case $m=2$, an algorithm with an absolute error of at most 1 is suggested, with complexity $O(n^2 \log n)$. For general $m$, we observe (together with A.\ V.\ Karzanov) that the ceiling rounding of an extreme-point solution for the corresponding integral linear program is an approximation with an absolute error of at most $m-1$; for $m$ fixed, $O(n^{m+1})$ time being sufficient to obtain such a solution. |

Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1997/CS/CS0913), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1997

To the main CS technical reports page