Approximation schemes for a class of subset selection problems |
| |
Authors: | Kirk Pruhs Gerhard J. Woeginger |
| |
Affiliation: | 1. Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA;2. Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands |
| |
Abstract: | In this paper we develop an easily applicable algorithmic technique/tool for developing approximation schemes for certain types of combinatorial optimization problems. Special cases that are covered by our result show up in many places in the literature. For every such special case, a particular rounding trick has been implemented in a slightly different way, with slightly different arguments, and with slightly different worst case estimations. Usually, the rounding procedure depended on certain upper or lower bounds on the optimal objective value that have to be justified in a separate argument. Our easily applied result unifies many of these results, and sometimes it even leads to a simpler proof. |
| |
Keywords: | Approximation algorithm Approximation scheme FPTAS Worst case analysis Pseudo-polynomial algorithm Combinatorial optimization Scheduling theory |
本文献已被 ScienceDirect 等数据库收录! |
|