✦ LIBER ✦

Polynomial time approximation of dense weighted instances of MAX-CUT

✍ Scribed by W. Fernandez de la Vega; M. Karpinski

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 162 KB
Volume: 16
Category: Article
ISSN: 1042-9832
DOI: 10.1002/1098-2418(200007)16:4<314::aid-rsa2>3.0.co;2-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Polynomial-time approximation scheme for

Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

✍ T.C. Edwin Cheng; Qingqin Nong; Chi To Ng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views