✦ LIBER ✦

The irreducible Core of a minimum cost spanning tree game

✍ Scribed by Harry Aarts; Theo Driessen

Publisher: Springer
Year: 1993
Tongue: English
Weight: 606 KB
Volume: 38
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01414212

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of testing membership

On the complexity of testing membership in the core of min-cost spanning tree games

✍ Ulrich Faigle; Walter Kern; Sándor P. Fekete; Winfried Hochstättler 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 291 KB

On the value of a random minimum spannin

On the value of a random minimum spanning tree problem

✍ A.M. Frieze 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A hierarchy of hop-indexed models for th

A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem

✍ Gouveia, Luis; Martins, Pedro 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB 👁 2 views

The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning tree subject to an additional constraint stating that the number of nodes in each subtree pending from a given root node is not greater than a given number Q. Gouveia and Martins (1996) proposed a hop-indexed flow mo

A comparative analysis of several formul

A comparative analysis of several formulations for the generalized minimum spanning tree problem

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 423 KB 👁 1 views

Efficient algorithms for finding the mos

Efficient algorithms for finding the most vital edge of a minimum spanning tree

✍ Kazuo Iwano; Naoki Katoh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 196 KB

On the core of a traveling salesman cost

On the core of a traveling salesman cost allocation game

✍ Arie Tamir 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 262 KB