✦ LIBER ✦

Complexity of spanning tree problems with leaf-dependent objectives

✍ Scribed by Mauro Dell'Amico; Martine Labbé; Francesco Maffioli

Book ID: 119982755
Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 580 KB
Volume: 27
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199605)27:3<175::aid-net2>3.0.co;2-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of spanning tree problems: Pa

Complexity of spanning tree problems: Part I

✍ P.M. Camerini; G. Galbiati; F. Maffioli 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 794 KB

The Complexity of Minimum Ratio Spanning

The Complexity of Minimum Ratio Spanning Tree Problems

✍ Christopher C. Skiścim; Susan W. Palocsay 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 349 KB

Element perturbation problems of optimum

Element perturbation problems of optimum spanning trees with two-parameter objectives

✍ Yung-Cheng Chang; Lih-Hsing Hsu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Parameterized Complexity of the Spanning

Parameterized Complexity of the Spanning Tree Congestion Problem

✍ Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; Leeuwen, 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 893 KB

The computational complexity of the κ-mi

The computational complexity of the κ-minimum spanning tree problem in graded matrices

✍ T. Dudás; B. Klinz; G.J. Woeginger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Given an undirected graph G = (V, E) where each edge e = (i,j) has a length dij >\_ O, the k-minimum spanning tree problem, k-MST for short, is to find a tree T in G which spans at least k vertices and has minimum length l(T) = ~'~(~,j)e T dij. We investigate the computational complexity of the k-mi

On the inverse problem of minimum spanni

On the inverse problem of minimum spanning tree with partition constraints

✍ Jianzhong Zhang; Zhenhong Liu; Zhongfan Ma 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 493 KB