مرکز منطقه ای اطلاع رساني علوم و فناوري - Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

Title of article :

Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem

Author/Authors :

Yongjin Lee، نويسنده , , M. Atiquzzaman، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2005

Pages :

From page :

1371

To page :

1379

Keywords :

ROUTING , topology discovery , DC-CMST problem , Networking , Heuristic algorithm

Journal title :

Computer Communications

Serial Year :

2005

Journal title :

Computer Communications

Record number :

310103

Link To Document :