2861 search results - page 58 / 573 » The multi-layered network design problem |
175
click to vote
EUROCAST
2009
Springer
16 years 16 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
145
click to vote
WEA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
146
click to vote
WWW
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we propose a multicast-on-large-demand (MOLD) approach to the flash crowd problem. A MOLD Web server may dynamically open a multicast channel for resources when dete...
175
click to vote
EVOW
2008
Springer
15 years 7 months ago
2008
Springer
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
166
click to vote
CC
2006
Springer
15 years 9 months ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...