✦ LIBER ✦

Fully Polynomial Approximation Schemes for

✍ Scribed by Hans Kellerer; Vitaly A. Strusevich

Publisher: Springer
Year: 2008
Tongue: English
Weight: 553 KB
Volume: 57
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-008-9248-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fully polynomial approximation scheme

A fully polynomial approximation scheme for the total tardiness problem

✍ E.L. Lawler 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 169 KB

An asymptotic fully polynomial time appr

An asymptotic fully polynomial time approximation scheme for bin covering

✍ Klaus Jansen; Roberto Solis-Oba 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 KB

In the bin covering problem there is a group L = (a1; : : : ; an) of items with sizes s(ai) ∈ (0; 1), and the goal is to ÿnd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In th

An efficient fully polynomial approximat

An efficient fully polynomial approximation scheme for the Subset-Sum Problem

✍ Hans Kellerer; Renata Mansini; Ulrich Pferschy; Maria Grazia Speranza 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Given a set of n positive integers and a knapsack of capacity c; the Subset-Sum Problem is to find a subset the sum of which is closest to c without exceeding the value c: In this paper we present a fully polynomial approximation scheme which solves the Subset-Sum Problem with accuracy e in time Oðm

A fully polynomial bicriteria approximat

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

✍ Sung-Pil Hong; Sung-Jin Chung; Bum Hwan Park 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. First, an exact pseudo-polynomial algorithm is developed based on a two-variable extension of the well-known matrix-tree theorem. The scaling and approximate binary search techniques are then uti

Scheduling Malleable Parallel Tasks: An

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

✍ Klaus Jansen 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 230 KB

Polynomial time approximation schemes fo

Polynomial time approximation schemes for class-constrained packing problems

✍ Hadas Shachnai; Tami Tamir 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 207 KB

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can