Sciweavers

2 search results - page 1 / 1
» Oblivious Buy-at-Bulk in Planar Graphs
Sort
View
87
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 6 months ago
Oblivious Buy-at-Bulk in Planar Graphs
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 ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
CCCG
2006
14 years 11 months ago
Routing with Guaranteed Delivery on Virtual Coordinates
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...
Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler