✦ LIBER ✦

An O(m log n) algorithm for the max + sum spanning tree problem

✍ Scribed by Abraham P. Punnen; K.P.K. Nair

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 240 KB
Volume: 89
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)00252-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log m) parallel algorithm for the m

An O(log m) parallel algorithm for the minimum spanning tree problem

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB

An O(n log m) algorithm for the Josephus

An O(n log m) algorithm for the Josephus Problem

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB

An O(log n) parallel algorithm for const

An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

An O(n log n) algorithm for the convex b

An O(n log n) algorithm for the convex bipartite matching problem

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB

An artificial bee colony algorithm for t

An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem

✍ Alok Singh 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 147 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