Improved sparse covers for graphs excluding a fixed minor

We consider the construction of sparse covers for planar graphs and other graphs that exclude a fixed minor. We present an algorithm that gives a cover for the γ-neighborhood of each node. For planar graphs, the cover has radius no more than 24γ-8 and degree (maximum cluster overlaps) no more than 18. For every n node graph that excludes a fixed minor, we present an algorithm that yields a cover with radius no more than 4γ and degree O(log n). This is a significant improvement over previous results for planar graphs and for graphs excluding a fixed minor; in order to obtain clusters with radius of O(γ), it was required to have degree polynomial in n. Since sparse covers have many applications in distributed computing, including compact routing, distributed directories and synchronizers, our improved cover construction results in improved algorithms for all these problems, for the class of graphs that exclude a fixed minor.

[1]  Ittai Abraham,et al.  Strong-diameter decompositions of minor free graphs , 2007, SPAA.

[2]  Andréa W. Richa,et al.  Optimal-stretch name-independent compact routing in doubling metrics , 2006, PODC '06.

[3]  Richard S. Varga,et al.  Proof of Theorem 5 , 1983 .

[4]  Ittai Abraham,et al.  Object location using path separators , 2006, PODC '06.

[5]  Baruch Awerbuch,et al.  Concurrent online tracking of mobile users , 1991, SIGCOMM 1991.

[6]  R. Varga,et al.  Proof of Theorem 4 , 1983 .

[7]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[8]  David Peleg,et al.  Compact and localized distributed data structures , 2003, Distributed Computing.

[9]  Cyril Gavoille,et al.  Routing in distributed networks: overview and open problems , 2001, SIGA.

[10]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Baruch Awerbuch,et al.  Sparse Partitions (Extended Abstract , 1990, FOCS 1990.

[12]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[13]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[14]  Greg N. Frederickson,et al.  Efficient Message Routing in Planar Networks , 1989, SIAM J. Comput..

[15]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[16]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[17]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[18]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[19]  Mikkel Thorup,et al.  Compact oracles for reachability and approximate distances in planar digraphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[20]  Mikkel Thorup,et al.  Compact name-independent routing with minimum stretch , 2008, ACM Trans. Algorithms.

[21]  Andrew V. Goldberg,et al.  Routing in Networks with Low Doubling Dimension , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[22]  Andréa W. Richa,et al.  Optimal scale-free compact routing schemes in networks of low doubling dimension , 2007, SODA '07.

[23]  Mikkel Thorup,et al.  Compact routing schemes , 2001, SPAA '01.

[24]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[25]  David Peleg,et al.  Distance-Dependent Distributed Directories , 1993, Inf. Comput..

[26]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[27]  Rajmohan Rajaraman,et al.  Compact Routing with Name Independence , 2006, SIAM J. Discret. Math..

[28]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.

[29]  Adrian Segall,et al.  Low Complexity Network Synchronization , 1994, WDAG.

[30]  Udi Wieder,et al.  Strongly-Bounded Sparse Decompositions of Minor Free Graphs , 2006 .

[31]  Ittai Abraham,et al.  Compact Routing for Graphs Excluding a Fixed Minor , 2005, DISC.

[32]  Baruch Awerbuch,et al.  On buffer-economical store-and-forward deadlock prevention , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[33]  Baruch Awerbuch,et al.  Online tracking of mobile users , 1995, JACM.