✦ LIBER ✦

A PTAS for weight constrained Steiner trees in series–parallel graphs

✍ Scribed by Guangting Chen; Guoliang Xue

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 225 KB
Volume: 304
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00088-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A compact labeling scheme for series-par

A compact labeling scheme for series-parallel graphs

✍ George Steiner 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 731 KB

A faster approximation algorithm for the

A faster approximation algorithm for the steiner tree problem in graphs

✍ Alexander Z. Zelikovsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 369 KB

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

Polynomial-time algorithms for solving a

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

✍ Siqian Shen; J. Cole Smith 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

A linear time algorithm to solve the wei

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs

✍ Chain-Chin Yen; R.C.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 379 KB

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce