𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bicriteria Network Design Problems

✍ Scribed by Madhav V Marathe; R Ravi; Ravi Sundaram; S.S Ravi; Daniel J Rosenkrantz; Harry B Hunt III

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
268 KB
Volume
28
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

A reliability-based network design probl
A reliability-based network design problem
✍ Piya Chootinan; S. C. Wong; Anthony Chen πŸ“‚ Article πŸ“… 2005 πŸ› Institute for Transportation Inc. 🌐 English βš– 1020 KB
The complexity of the network design pro
The complexity of the network design problem
✍ D. S. Johnson; J. K. Lenstra; A. H. G. Rinnooy Kan πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 278 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