236 search results - page 18 / 48 » On the Vehicle Routing Problem with lower bound capacities |
129
click to vote
ICC
2009
IEEE
14 years 9 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
110
Voted
TWC
2008
14 years 11 months ago
2008
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
113
click to vote
ALGORITHMICA
2006
14 years 11 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)...