✦ LIBER ✦

Comparing Universal Covers in Polynomial Time

✍ Scribed by Jiří Fiala; Daniël Paulusma

Book ID: 105915094
Publisher: Springer
Year: 2009
Tongue: English
Weight: 506 KB
Volume: 46
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-009-9200-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universality in the lattice-covering tim

Universality in the lattice-covering time problem

✍ Nemirovsky, A. M.; Mártin, H. O.; Coutinho-Filho, M. D. 📂 Article 📅 1990 🏛 The American Physical Society 🌐 English ⚖ 368 KB

Holomorphic universal covering spaces of

Holomorphic universal covering spaces of polynomials without multiple roots

✍ Sh. I. Kaliman 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 112 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 algorithms for regular s

Polynomial-time algorithms for regular set-covering and threshold synthesis

✍ Uri N. Peled; Bruno Simeone 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 713 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

Tutte polynomials computable in polynomi

Tutte polynomials computable in polynomial time

✍ J.G. Oxley; D.J.A. Welsh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 717 KB