45 search results - page 8 / 9 » Oblivious routing in directed graphs with random demands |
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
102
click to vote
ALGORITHMICA
2006
14 years 9 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
MP
1998
14 years 9 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...