loading...
On Designing Constrained Local Access Networks
Dallas/Richardson, Texas, USA December 07-December 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.9002822000 International Symposium on Paral ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
H. Dai, S. Fujino, "On Designing Constrained Local Access Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 167, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2000.900282,
author = {H. Dai and S. Fujino},
title = {On Designing Constrained Local Access Networks},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2000},
issn = {1087-4089},
pages = {167},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900282},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - On Designing Constrained Local Access Networks
SN - 1087-4089
SP
EP
A1 - H. Dai,
A1 - S. Fujino,
PY - 2000
KW - null
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Most network design problems are computationally intractable. For obtaining approximations, greedy heuristics are commonly employed. The Esau-Williams algorithm adopts a better greedy heuristic in solving (constrained) capacitated minimum spanning tree (CMST) problem, using a trade off function computing the potential saving in the cost of a link. In this study, the component-oriented tradeoff computation is employed instead of the node-oriented one to implement the heuristic efficiently. The improved Esau-Williams algorithm is modified for variations of the CMST problems with order, degree, and depth constraints.
Citation:
H. Dai, S. Fujino, "On Designing Constrained Local Access Networks," ispan, pp.167, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000
Usage of this product signifies your acceptance of the Terms of Use.