✦ LIBER ✦

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

✍ Scribed by Erlebach, Thomas; Jansen, Klaus; Seidel, Eike

Book ID: 118017534
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 282 KB
Volume: 34
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539702402676

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial Time Approximation Schemes fo

Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs

✍ Jansen, Klaus; Karpinski, Marek; Lingas, Andrzej; Seidel, Eike 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 152 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for

✍ Jianping Li, Weidong Li, Lusheng Wang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 433 KB

Polynomial-time approximation schemes fo

Polynomial-time approximation schemes for scheduling problems with time lags

✍ Xiandong Zhang; Steef van de Velde 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 322 KB

Fully Polynomial Approximation Schemes f

Fully Polynomial Approximation Schemes for

✍ Hans Kellerer; Vitaly A. Strusevich 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 553 KB

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