236 search results - page 25 / 48 » On the Vehicle Routing Problem with lower bound capacities |
180
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
162
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
151
click to vote
ICDCS
2006
IEEE
16 years 3 days ago
2006
IEEE
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
166
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
175
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...