𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial algorithms to finite Veber problem for a tree network

✍ Scribed by Anatoly V. Panyukov; Boris V. Pelzwerger

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
356 KB
Volume
35
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 strongly polynomial algorithm for the
A strongly polynomial algorithm for the uniform balanced network flow problem
✍ Maria Grazia ScutellΓ‘ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 565 KB

## Several balanced optimization problems have been analysed in the literature. Here, the balanced network flow problem in the uniform case is studied, and it is shown that it can be solved by the Newton's approach in O(n' log3 n) max-flow computations. The key of the proof is an extension of Rad

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