✦ LIBER ✦

The non-approximability of bicriteria network design problems

✍ Scribed by Vojtech Bálint

Book ID: 108497740
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 279 KB
Volume: 1
Category: Article
ISSN: 1570-8667
DOI: 10.1016/s1570-8667(03)00033-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bicriteria Network Design Problems

✍ Madhav V Marathe; R Ravi; Ravi Sundaram; S.S Ravi; Daniel J Rosenkrantz; Harry B 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 268 KB

We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization Ž . objectives under different cost functions , with a budget specified on the first

Average-Case Non-Approximability of Opti

Average-Case Non-Approximability of Optimisation Problems

✍ Birgit Schelm 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 265 KB

Efficient solutions for the bicriteria n

Efficient solutions for the bicriteria network flow problem

✍ P.Simin Pulat; Fenghueih Huarng; Haijune Lee 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 669 KB

Strongly polynomial-time approximation f

Strongly polynomial-time approximation for a class of bicriteria problems

✍ Asaf Levin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 190 KB

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

Approximate Integer Decompositions for U

Approximate Integer Decompositions for Undirected Network Design Problems

✍ Chekuri, Chandra; Shepherd, F. Bruce 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 237 KB