𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized steiner problem in series-parallel networks

✍ Scribed by Pawel Winter

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
816 KB
Volume
7
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel scheduling problems in next gen
Parallel scheduling problems in next generation wireless networks
✍ L. Becchetti; S. Leonardi; A. Marchetti-Spaccamela; A. Vitaletti; S. Diggavi; S. πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 182 KB

## Abstract Next‐generation 3G/4G wireless data networks allow multiple codes (or channels) to be allocated to a single user, where each code can support multiple data rates. Providing fine‐grained QoS to users in such networks poses the two‐dimensional challenge of assigning both power (rate) and

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

Some generalizations of the steiner prob
Some generalizations of the steiner problem in graphs
✍ C. W. Duin; A. Volgenant πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning