✦ LIBER ✦

A simple approximation algorithm for two problems in circuit design

✍ Scribed by Carpenter, T.; Cosares, S.; Ganley, J.L.; Saniee, I.

Book ID: 119772918
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 145 KB
Volume: 47
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.736445

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for a Capacitat

Approximation Algorithms for a Capacitated Network Design Problem

✍ Refael Hassin; R. Ravi; F. Sibel Salman 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 804 KB

A simple approximation algorithm for the

A simple approximation algorithm for the weighted matching problem

✍ Doratha E Drake; Stefan Hougardy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [

3-Approximation algorithm for a two depo

3-Approximation algorithm for a two depot, heterogeneous traveling salesman problem

✍ Sai Yadlapalli; Sivakumar Rathinam; Swaroop Darbha 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 238 KB

A simple LP-free approximation algorithm

A simple LP-free approximation algorithm for the minimum weight vertex cover problem

✍ Teofilo F. Gonzalez 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

A -approximation algorithm for the two-m

A -approximation algorithm for the two-machine routing open-shop problem on a two-node network

✍ Igor Averbakh; Oded Berman; Ilya Chernykh 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 527 KB

A new linear algorithm for the initial p

A new linear algorithm for the initial placement problem of the circuit layout design

✍ Imre Abos 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB