𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lowering eccentricity of a tree by node upgrading

✍ Scribed by Toshihide Ibaraki; Yann Vaxès; Xiao-guang Yang

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
135 KB
Volume
45
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving Minimum Cost Spanning Trees by
Improving Minimum Cost Spanning Trees by Upgrading Nodes
✍ S.O Krumke; M.V Marathe; H Noltemeier; R Ravi; S.S Ravi; R Sundaram; H.-C Wirth 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Ž O O Žlog log n. . 2. In contrast, we show that, unless NP : DTIME n , there can be no polynomial time approximation algorithm for the problem that produces a solution with upgrading cost at most ␣ln n times the optimal upgrading cost Ž . even if the budget can be violated by a factor f n , for any

A strong lower bound for the Node Weight
A strong lower bound for the Node Weighted Steiner Tree Problem
✍ Engevall, Stefan; G�the-Lundgren, Maud; V�rbrand, Peter 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is a generalization of the Steiner tree problem in the sense that vertex weights are considered. Given an undirected graph, the problem is to find a tree that spans a subset of the vertices and is such that the total

Catalytic Upgrading of Bio-Oils by Keton
Catalytic Upgrading of Bio-Oils by Ketonization
✍ Christian A. Gärtner; Juan Carlos Serrano-Ruiz; Drew J. Braden; James A. Dumesic 📂 Article 📅 2009 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 272 KB
On the lower length of the closed-set la
On the lower length of the closed-set lattice of a tree
✍ K.M. Koh; K.S. Poh 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Let L(T) be the closed-set latice of a tree T. The lower length l, (L(T)) of L (T) is defined as Call a set S of vertices in T a sparse set if d(x, y)/> 3 for any two distinct vertices x, y in S. The sparsity y(T) of T is defined as y(T) = max {Isl: s is a sparse set of T}. We prove that, for any