✦ LIBER ✦

Problems with generalized steiner problems

✍ Scribed by Stefan Voß

Publisher: Springer
Year: 1992
Tongue: English
Weight: 141 KB
Volume: 7
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01758767

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The General Steiner Tree-Star problem

✍ Samir Khuller; An Zhu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 78 KB

The Steiner tree problem is defined as follows-given a graph G = (V , E) and a subset X ⊂ V of terminals, compute a minimum cost tree that includes all nodes in X. Furthermore, it is reasonable to assume that the edge costs form a metric. This problem is NP-hard and has been the study of many heuris

Generalized steiner problem in outerplan

Generalized steiner problem in outerplanar networks

✍ Pawel Winter 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 757 KB

Steiner tree problems

✍ Warren D. Smith; Peter W. Shor 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 176 KB

Generalized steiner problem in series-pa

Generalized steiner problem in series-parallel networks

✍ Pawel Winter 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 816 KB

The Polymatroid Steiner Problems

✍ G. Calinescu; A. Zelikovsky 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 667 KB

The general Steiner problem in rectangul

The general Steiner problem in rectangular crisscross space

✍ Shou-Tian Ting; Shu-Yu Zhao 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The crisscross space is rectangularly structured. Start from a Cartesian coordinate system with distance D of points defined as D(P1, P,)=Ixz-x,I+Jy2-y,I, where P,=(xr,y,) and P,(x,, yz) are points in the real plane. The general Steiner problem is to find the minimum point P of @(P)=~~=l ciD (P,, p