236 search results - page 24 / 48 » On the Vehicle Routing Problem with lower bound capacities |
189
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
168
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
205
click to vote
MFCS
2005
Springer
15 years 11 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
168
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
169
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...