Sciweavers

2343 search results - page 111 / 469
» The Locomotive Routing Problem
Sort
View
FOCS
2009
IEEE
14 years 4 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra
CCGRID
2007
IEEE
14 years 4 months ago
Query-load balancing in structured overlays
Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take...
Anwitaman Datta, Roman Schmidt, Karl Aberer
OSN
2007
185views more  OSN 2007»
13 years 9 months ago
Comparison of ILP formulations for the RWA problem
— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
Brigitte Jaumard, Christophe Meyer, B. Thiongane
COMCOM
2006
100views more  COMCOM 2006»
13 years 10 months ago
Routing and wavelength assignment for core-based tree in WDM networks
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
Jianping Wang, Xiangtong Qi, Mei Yang
ICC
2008
IEEE
115views Communications» more  ICC 2008»
14 years 4 months ago
Oblivious Routing for Wireless Mesh Networks
—Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing pl...
Jonathan Wellons, Yuan Xue