𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Max-min Problem Concerning Weights of Edges

✍ Scribed by Stanislav Jendrol'; Ingo Schiermeyer

Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
159 KB
Volume
21
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the max-weight edge coloring problem
On the max-weight edge coloring problem
✍ Giorgio Lucarelli; Ioannis Milis; Vangelis T. Paschos πŸ“‚ Article πŸ“… 2009 πŸ› Springer US 🌐 English βš– 416 KB
On a Problem Concerning the Weight Funct
On a Problem Concerning the Weight Functions
✍ Giampiero Chiaselotti πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 75 KB

On a Problem Concerning the Weight Functions ## GIAMPIERO CHIASELOTTI † Let X be a finite set with n elements. A function f : X -β†’ R such that x∈X f (x) β‰₯ 0 is called a n-weight function. In 1988 Manickam and Singhi conjectured that, if d is a positive integer and f is a n-weight function with n

Solving min-max shortest-path problems o
Solving min-max shortest-path problems on a network
✍ Ishwar Murthy; Shenq-Shyong Her πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri