✦ LIBER ✦

A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

✍ Scribed by Karger, David R.

Book ID: 118178186
Publisher: Society for Industrial and Applied Mathematics
Year: 1999
Tongue: English
Weight: 403 KB
Volume: 29
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539796298340

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Fully Polynomial Time Approximatio

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

✍ Hans Kellerer; Ulrich Pferschy 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 76 KB

A fully polynomial approximation scheme

A fully polynomial approximation scheme for the total tardiness problem

✍ E.L. Lawler 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 169 KB

A fully polynomial bicriteria approximat

A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

✍ Sung-Pil Hong; Sung-Jin Chung; Bum Hwan Park 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We propose a fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. First, an exact pseudo-polynomial algorithm is developed based on a two-variable extension of the well-known matrix-tree theorem. The scaling and approximate binary search techniques are then uti

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

✍ Chekuri, Chandra; Khanna, Sanjeev 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB

A Polynomial Time Approximation Scheme f

A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways

✍ Xiuzhen Cheng; Joon-Mo Kim; Bing Lu 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 127 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the SONET ring loading problem

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views