66 search results - page 9 / 14 » Optimal oblivious routing in polynomial time |
159
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
150
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
209
click to vote
COMGEO
2012
ACM
14 years 1 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
186
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
163
click to vote
CCGRID
2008
IEEE
16 years 16 days ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...