Approximation schemes for a class of subset selection problems

Authors:
Kirk Pruhs;Gerhard J. Woeginger
Affiliations:
Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260, USA;Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Theoretical Computer Science
Year:
2007

Citing 13
Cited 7

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms

Introduction to Algorithms
An improved FPTAS for restricted shortest path

Information Processing Letters
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

Clustered subset selection and its applications on it service metrics

Proceedings of the 17th ACM conference on Information and knowledge management
Note: Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

Discrete Applied Mathematics
Constraint-based local search for fields partitioning problem

Proceedings of the Second Symposium on Information and Communication Technology
Universal sequencing on a single machine

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems

Discrete Optimization
Algorithms and complexity for periodic real-time scheduling

ACM Transactions on Algorithms (TALG)
A complexity and approximability study of the bilevel knapsack problem

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	5.23

Visualization

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. We demonstrate how our result can be easily applied to a broad family of combinatorial optimization problems. As a special case, we derive the existence of an FPTAS for the scheduling problem of minimizing the weighted number of late jobs under release dates and preemption on a single machine. The approximability status of this problem has been open for some time.