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

A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network

โœ Scribed by C.E. Yang; L.R. Foulds; J.L. Scott

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
456 KB
Volume
57
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient Parallel Algorithms for Optima
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
โœ Biing-Feng Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce

A polynomial algorithm for the minimum w
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
โœ Wen-Lian HSU; George L. Nemhauser ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection