2 search results - page 1 / 1 » Oblivious Buy-at-Bulk in Planar Graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
CCCG
2006
14 years 4 days ago
2006
We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work als...