570 search results - page 15 / 114 » Approximating Some Network Design Problems with Node Costs |
105
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...
111
click to vote
EMNETS
2007
15 years 5 months ago
2007
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
ISCC
2005
IEEE
15 years 7 months ago
2005
IEEE
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
109
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
108
click to vote
DISOPT
2008
15 years 1 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...