## Abstract We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. We characterize the worstβcase t
β¦ LIBER β¦
Location of central nodes in time varying computer networks
β Scribed by Ariel Orda; Raphael Rom
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 766 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Trade-offs on the location of the core n
β
Jean-FranΓ§ois Macq; Michel X. Goemans
π
Article
π
2004
π
John Wiley and Sons
π
English
β 128 KB
Efficient modeling of travel in networks
β
Mark E. T. Horn
π
Article
π
2000
π
John Wiley and Sons
π
English
β 156 KB
π 1 views
Synchronization in an array of linearly
β
Weiwei Wang; Jinde Cao
π
Article
π
2006
π
Elsevier Science
π
English
β 284 KB
Controllability and observability of hea
β
E.I. Varga; K.M. Hangos; F. Szigeti
π
Article
π
1995
π
Elsevier Science
π
English
β 896 KB
On formulation of a reliable cost alloca
β
Inder M Soi; K.K Aggarwal
π
Article
π
1980
π
Elsevier Science
π
English
β 405 KB
Steady state analysis of periodically ti
β
TohumoΔlu, GΓΌlay; KΓΆksal, Muhammet
π
Article
π
1996
π
John Wiley and Sons
π
English
β 574 KB
The analysis of networks with time-varying elements is more complicated than the analysis of networks with constant elements. Frequency domain analysis methods are well established for the analysis of timeinvariant networks. Since the complete solution can be computed for only a very narrow class of