๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Generating lower bounds for the linear arrangement problem

โœ Scribed by Weiguo Liu; Anthony Vannelli


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
806 KB
Volume
59
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Lower bounds for linear interval routing
โœ Eilam, T.; Moran, S.; Zaks, S. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 211 KB ๐Ÿ‘ 2 views

Linear interval routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant of interval routing where the routing range associated with every link is represented by an interval with no wraparound. A common way to measure the efficiency of such ro