✦ LIBER ✦

Hardness of fully dense problems

✍ Scribed by Nir Ailon; Noga Alon

Book ID: 113641691
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 170 KB
Volume: 205
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2007.02.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hardness of dense β-Si3N4

✍ C. Greskovich; H. C. Yeh 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 253 KB

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

Hardness of dense α- and β-Si3N4ceramics

✍ C. Greskovich; G. E. Gazza 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 157 KB

Problems of hardness measurement

✍ F. Petik 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 713 KB

Hard probes of dense matter

✍ Helmut Satz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Polynomial Time Approximation Schemes fo

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

✍ M. Karpinski 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 64 KB