✦ LIBER ✦

Polynomial-time approximation schemes for scheduling problems with time lags

✍ Scribed by Xiandong Zhang; Steef van de Velde

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 322 KB
Volume: 13
Category: Article
ISSN: 1094-6136
DOI: 10.1007/s10951-009-0134-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Polynomial time approximation schemes fo

Polynomial time approximation schemes for minimum disk cover problems

✍ Chen Liao; Shiyan Hu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 409 KB

Polynomial-time approximation schemes fo

Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints

✍ M.A. Kubzin; V.A. Strusevich; J. Breit; G. Schmidt 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

Polynomial time approximation algorithms

Polynomial time approximation algorithms for machine scheduling: ten open problems

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 91 KB 👁 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

Polynomial Time Approximation Schemes fo

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

✍ Sanjeev Arora; David Karger; Marek Karpinski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 250 KB

We present a unified framework for designing polynomial time approximation schemes (PTASs) for ``dense'' instances of many NP-hard optimization problems, including maximum cut, graph bisection, graph separation, minimum k-way cut with and without specified terminals, and maximum 3-satisfiability. By

On polynomial-time approximation algorit

On polynomial-time approximation algorithms for the variable length scheduling problem

✍ Artur Czumaj; Leszek Ga̧sieniec; Daya Ram Gaur; Ramesh Krishnamurti; Wojciech Ry 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 195 KB

This paper may be viewed as a corrigendum as well as an extension of the paper by (Czumaj et al., Theoret. Comput. Sci. 262 (1-2), ( 2001) 569-582) where they deal with the variable length scheduling problem (VLSP) with parameters k1; k2, denoted VLSP(k1; k2). In the current paper, we ÿrst discuss a