Abstract
Greedy algorithm is offered for locating central network resources on communication network. The algorithm is generic and can be applied to various networks. The proposed method gives the network manager analytical tools to deal with the issue of how to locate central resources in networks. The algorithm was compared to optimal solution where possible, to lower bound, and to the results of simulated annealing.
| Original language | English |
|---|---|
| Pages | 5-8 |
| Number of pages | 4 |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr Duration: 5 Nov 1996 → 6 Nov 1996 |
Conference
| Conference | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel |
|---|---|
| City | Jerusalem, Isr |
| Period | 5/11/96 → 6/11/96 |