Sciweavers

236 search results - page 41 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
JGAA
2006
127views more  JGAA 2006»
14 years 11 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
CORR
2006
Springer
107views Education» more  CORR 2006»
14 years 11 months ago
Optimal Scheduling of Peer-to-Peer File Dissemination
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Intern...
Jochen Mundinger, Richard R. Weber, Gideon Weiss
WIOPT
2010
IEEE
14 years 9 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely
SPAA
1999
ACM
15 years 4 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
IGIS
1994
156views GIS» more  IGIS 1994»
15 years 3 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six