𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal algorithm for rectilinear steiner trees for channels with obstacles

✍ Scribed by Charles Chiang; Majid Sarrafzadeh; C. K. Wong

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Volume
19
Category
Article
ISSN
0098-9886

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A polynomial time algorithm for rectilin
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
✍ Brazil, M.; Thomas, D. A.; Weng, J. F. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 168 KB πŸ‘ 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

An Optimal Algorithm for Broadcasting Mu
An Optimal Algorithm for Broadcasting Multiple Messages in Trees
✍ Krzysztof Diks; Andrzej Lingas; Andrzej Pelc πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 118 KB

We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A k-message broadcasting

H. Almuallim, An efficient algorithm for
H. Almuallim, An efficient algorithm for optimal of decision trees
πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 69 KB

Situations in which them is competition among possible contractor agents or possible manager agents are also considered. In all situations we assume that the contractor can choose a level of effort when carrying out the task and we would like the contractor to carry out the task efficiently without

An algorithm for optimal shipments with
An algorithm for optimal shipments with given frequencies
✍ M. G. Speranza; W. Ukovich πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 817 KB

This article deals with the problem of minimizing the transportation and inventory cost associated with the shipment of several products from a source to a destination, when a finite set of shipping frequencies is available. A mixed-integer programming model-shown to be NP-hard-is formulated for tha

A New Approximation Algorithm for the St
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
✍ Hans JΓΌrgen PrΓΆmel; Angelika Steger πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 100 KB

In this paper we present an RNC approximation algorithm for the Steiner tree problem in graphs with performance ratio 5r3 and RNC approximation algorithms for the Steiner tree problem in networks with performance ratio 5r3 q β‘€ for all β‘€ ) 0. This is achieved by considering a related problem, the min