✦ LIBER ✦

Approximate Integer Decompositions for Undirected Network Design Problems

✍ Scribed by Chekuri, Chandra; Shepherd, F. Bruce

Book ID: 118196883
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 237 KB
Volume: 23
Category: Article
ISSN: 0895-4801
DOI: 10.1137/040617339

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

Decomposition theory for multidisciplina

Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems

✍ Raphael T. Haftka; Layne T. Watson 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 295 KB

Approximation Algorithms for Network Des

Approximation Algorithms for Network Design Problems on Bounded Subsets

✍ Dorit S. Hochbaum; Joseph (Seffi) Naor 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher

Hardness of Approximation for Vertex-Con

Hardness of Approximation for Vertex-Connectivity Network Design Problems

✍ Kortsarz, Guy; Krauthgamer, Robert; Lee, James R. 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 240 KB

Sequential approximate optimization for

Sequential approximate optimization for discrete design variable problems using radial basis function network

✍ Satoshi Kitayama; Masao Arakawa; Koetsu Yamazaki 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 898 KB

Decomposition Methods for Network Design

✍ Bernard Gendron 📂 Article 📅 2011 🏛 Elsevier 🌐 English ⚖ 344 KB