46 search results - page 1 / 10 » A Preemptive Algorithm for Maximizing Disjoint Paths on Tree... |
ALGORITHMICA
2010
13 years 4 months ago
2010
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
ADHOC
2007
13 years 4 months ago
2007
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
SOFSEM
2010
Springer
14 years 1 months ago
2010
Springer
CJ
2011
12 years 8 months ago
2011
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In wireless sensor networks, bandwidth is one of precious resources to multimedia applications. To get more bandwidth, multipath routing is one appropriate solution provided that ...