CiteULike ima's CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks

by: Song Guo, V. C. M. Leung
Networking, IEEE/ACM Transactions on, Vol. 18, No. 4. (August 2010), pp. 1067-1076, doi:10.1109/tnet.2009.2038998  Key: citeulike:12040580

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


Abstract

We consider the problem of finding a multicast tree rooted at the source node and including all the destination nodes such that the maximum weight of the tree arcs is minimized. It is of paramount importance for many optimization problems,


ima's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.