𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms and complexity of the periodic maintenance problem

✍ Scribed by Al Mok; Louis Rosier; Igor Tulchinsky; Donald Varvel

Publisher
Elsevier Science
Year
1989
Weight
640 KB
Volume
27
Category
Article
ISSN
0165-6074

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The time-dependent shortest pair of disj
The time-dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms
✍ Sherali, Hanif D.; Ozbay, Kaan; Subramanian, Shivaram πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 160 KB πŸ‘ 3 views

In this paper, we examine complexity issues, models, and algorithms for the problem of finding a shortest pair of disjoint paths between two nodes of a network such that the total travel delay is minimized, given that the individual arc delays are time-dependent. Such disjoint paths address the issu

A complete spanning tree maintenance alg
A complete spanning tree maintenance algorithm and its complexity
✍ Akinori Saitoh; Yoshihiro Tsujino; Nobuki Tokura πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 891 KB

## Abstract The spanning tree maintenance problem for an LAN model in which node processors may halt and recover is considered. An algorithm meeting the conditions that the spanning tree is an __L__‐ary complete tree and that nodes halt or recover singly is presented. The message complexity of this