Approximation schemes for a class of subset selection problems

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 rou...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 382; no. 2; pp. 151 - 156
Main Authors:	Pruhs, Kirk, Woeginger, Gerhard J.
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Amsterdam Elsevier B.V 31.08.2007 Elsevier
Subjects:	Applied sciences Approximation algorithm Approximation scheme Calculus of variations and optimal control Combinatorial optimization Computer science; control theory; systems Computer systems performance. Reliability Exact sciences and technology FPTAS Mathematical analysis Mathematics Miscellaneous Numerical analysis Numerical analysis. Scientific computation Numerical methods in mathematical programming, optimization and calculus of variations Pseudo-polynomial algorithm Scheduling theory Sciences and techniques of general use Software Theoretical computing Worst case analysis Pseudo-polynomial algorithm Approximation scheme Approximation algorithm FPTAS Combinatorial optimization Scheduling theory Worst case analysis Polynomial Lower bound Approximation Computer theory Combinatorial problem Estimation Optimization method Algorithmics Scheduling Implementation Selection problem Upper bound Proof Procedure Single machine
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!