94 search results - page 3 / 19 » Connections in Networks: Hardness of Feasibility Versus Opti... |
INFOCOM
2003
IEEE
13 years 11 months ago
2003
IEEE
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
SIAMDM
2008
13 years 5 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
TON
2002
13 years 5 months ago
2002
Abstract--Research on congestion-control algorithms has traditionally focused more on performance than on robustness of the closed-loop system to changes in network conditions. As ...
OL
2011
13 years 21 days ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
CEC
2009
IEEE
13 years 9 months ago
2009
IEEE
VANETs are ad hoc networks in which devices are vehicles moving at high speeds. This kind of network is getting more and more importance since it has many practical and important a...