๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Flows in Undirected Unit Capacity Networks

โœ Scribed by Goldberg, Andrew V.; Rao, Satish

Book ID
118199595
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
226 KB
Volume
12
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a realization problem from non-termin
On a realization problem from non-terminal capacity matrices on undirected flow networks
โœ Hiroshi Tamura; Masakazu Sengoku; Shoji Shinoda; Takeo Abe ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 309 KB

## Abstract The problem of realizing a given matrix on an undirected flow network has been studied and various results have been obtained. Most of these results consist of necessary and sufficient conditions for methods of realization in which the maximum good flow between the two points and the ma

Multiple cover problem on undirected flo
Multiple cover problem on undirected flow networks
โœ Hiroshi Tamura; Hidehito Sugawara; Masakazu Sengoku; Shoji Shinoda ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 187 KB

Problems concerning the optimum location of various devices installed in transport, communication, and other types of networks relate to the so-called location on network problems. In this paper, we show how an expanded multiple cover problem can be solved in polynomial time for the case of an undir

Locating Sources to Meet Flow Demands in
Locating Sources to Meet Flow Demands in Undirected Networks
โœ Kouji Arata; Satoru Iwata; Kazuhisa Makino; Satoru Fujishige ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 260 KB

This paper deals with the problem of finding a minimum-cost vertex subset S in an undirected network such that for each vertex v we can send d v units of flow from S to v. Although this problem is NP-hard in general, H.