✦ LIBER ✦

New Algorithm for Ordered Tree-to-Tree Correction Problem

✍ Scribed by Weimin Chen

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 179 KB
Volume: 40
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.2001.1170

No coin nor oath required. For personal study only.

✦ Synopsis

number of leaves of S and D D denotes the depth of S. The previous best S Ž< < < < Ä 4 Ä 4 . Ž algorithms for this problem run in O S T min L L , D D min L L , D D time K.

📜 SIMILAR VOLUMES

More Efficient Algorithm for Ordered Tre

More Efficient Algorithm for Ordered Tree Inclusion

✍ Weimin Chen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Given two ordered trees S S and T T, the tree inclusion problem is to determine whether it is possible to obtain S S from T T by deleting nodes. Recently, this problem has been recognized as an important primitive in query processing for Ž< Ž .< < <. structured text databases. In this paper we prese

A Faster Algorithm for the Inverse Spann

A Faster Algorithm for the Inverse Spanning Tree Problem

✍ Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 Ž 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre

Dual algorithms for the shortest path tr

Dual algorithms for the shortest path tree problem

✍ Pallottino, Stefano; Scutell�, Maria Grazia 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

A polynomial algorithm for thep-centdian

A polynomial algorithm for thep-centdian problem on a tree

✍ Tamir, Arie; P�rez-Brito, Dionisio; Moreno-P�rez, Jos� A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 2 views

The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is

A Polylogarithmic Approximation Algorith

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

✍ Naveen Garg; Goran Konjevod; R. Ravi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of vertices in a weighted graph, and the goal is to find a minimum-weight connected subgraph containing at least one vertex from each group.The problem was introduced by Reich a

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