Interchanging distance and capacity in probabilistic mappings

Details Interchanging distance and capacity in probabilistic mappings Interchanging distance and capacity in probabilistic mappings

2009-07-21

arxiv.org/abs/0907.3631v1

Computer Science

Data Structures and Algorithms

16 pages, no figures

Scientific paper

Harald Racke [STOC 2008] described a new method to obtain hierarchical decompositions of networks in a way that minimizes the congestion. Racke's approach is based on an equivalence that he discovered between minimizing congestion and minimizing stretch (in a certain setting). Here we present Racke's equivalence in an abstract setting that is more general than the one described in Racke's work, and clarifies the power of Racke's result. In addition, we present a related (but different) equivalence that was developed by Yuval Emek [ESA 2009] and is only known to apply to planar graphs.

Affiliated with

Also associated with

No associations

Rating

Interchanging distance and capacity in probabilistic mappings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interchanging distance and capacity in probabilistic mappings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interchanging distance and capacity in probabilistic mappings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175867