✦ LIBER ✦

A Distributed Algorithm for Computing the Node Search Number in Trees

✍ Scribed by David Coudert; Florian Huc; Dorian Mazauric

Publisher: Springer
Year: 2011
Tongue: English
Weight: 981 KB
Volume: 63
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9524-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tree search algorithm for the crew sch

A tree search algorithm for the crew scheduling problem

✍ J.E. Beasley; B. Cao 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 871 KB

A tree search algorithm for the p-median

A tree search algorithm for the p-median problem

✍ N. Christofides; J.E. Beasley 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 659 KB

A tree search algorithm for the multi-co

A tree search algorithm for the multi-commodity location problem

✍ Richard S. Laundy 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 523 KB

A Parallel Recursive Shortest Spanning T

A Parallel Recursive Shortest Spanning Tree Algorithm for Image Segmentation in Distributed Computing Environment

✍ S.H Kwok; A.G Constantinides 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 667 KB

A heuristic algorithm for the reliabilit

A heuristic algorithm for the reliability-oriented file assignment in a distributed computing system

✍ D.-J. Chen; W.C. Hol; R.-S. Chen; D.T.K. Chen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 994 KB

A tabu search algorithm for the Capacita

A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem

✍ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami