𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Push Tree problem

✍ Scribed by Frédéric Havet; Marc Wennink

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
165 KB
Volume
44
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The full-degree spanning tree problem
The full-degree spanning tree problem
✍ Randeep Bhatia; Samir Khuller; Robert Pless; Yoram J. Sussmann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

The full-degree spanning tree problem is defined as follows: Given a connected graph G G G = (V V V, E E E), find a spanning tree T T T to maximize the number of vertices whose degree in T T T is the same as in G G G (these are called vertices of "full" degree). This problem is NP-hard. We present a

The Optimal Alphabetic Tree Problem Revi
The Optimal Alphabetic Tree Problem Revisited
✍ Lawrence L Larmore; Teresa M Przytycka 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 202 KB

The Optimal Alphabetic Binary Tree OABT problem is equivalent to the Optimal Binary Search Tree problem where the weights are associated only with Ž . the leaves. The problem can be solved in O n log n time, while the best known Ž . lower bound is ⍀ n . In this paper we relate the complexity of the

The Steiner Tree Problem in Orientation
The Steiner Tree Problem in Orientation Metrics
✍ G.Y. Yan; A. Albrecht; G.H.F. Young; C.K. Wong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Given a set 3 of : i (i=1, 2, ..., k) orientations (angles) in the plane, one can define a distance function which induces a metric in the plane, called the orientation metric [3]. In the special case where all the angles are equal, we call the metric a uniform orientation metric [2]. Specifically,

The preemptive swapping problem on a tre
The preemptive swapping problem on a tree
✍ Shoshana Anily; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views