Object location using path separators

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 188-197

  Abraham, Ittai ^a   Gavoille, Cyril ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Compact Routing; Excluded Minor; Separator

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING; ROUTERS; SEPARATORS; TRACKING (POSITION);

COMPACT ROUTING; EXCLUDED MINOR;

OBJECT RECOGNITION;

EID: 33748680289     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146411     Document Type: Conference Paper

References (45)

1. I. ABRAHAM AND C. GAVOILLE, Object location using path separators, Research Report RR-1394-06, LaBRI, University of Bordeaux 1, France, Mar. 2006.
2. I. ABRAHAM, C. GAVOILLE, A. V. GOLDBERG, AND D. MALKHI, Routing in networks with low doubling dimension, in 26th International Conference on Distributed Computing Systems (ICDCS), IEEE Computer Society Press, July 2006. To appear.
3. I. ABRAHAM, C. GAVOILLE, AND D. MALKHI, Compact routing for graphs excluding a fixed minor, in 19th International Symposium on Distributed Computing (DISC), vol. 3724 of LNCS, Springer, Sept. 2005, pp. 442-456.
4. th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, July 2006.
5. J. ALBER, H. FERNAU, AND R. NIEDERMEIER, Graph separators: A parameterized view, Journal of Computer and System Sciences, 67 (2003), pp. 808-832.
6. N. ALON, P. D. SEYMOUR, AND R. THOMAS, A separator theorem for graphs with an excluded minor and its applications, in 22nd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, May 1990, pp. 293-299.
7. _, Planar separators, SIAM Journal on Discrete Mathematics, 7 (1994), pp. 184-193.
8. B. AWERBUCH AND D. PELEG, Sparse partitions, in 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Oct. 1990, pp. 503-513.
9. _, Routing with polynomial communication-space trade-off, SIAM Journal on Discrete Mathematics, 5 (1992), pp. 151-162.
10. H. T.-H. CHAN, A. GUPTA, B. M. MAGGS, AND S. ZHOU, On hierarchical routing in doubling metrics, in 16th Symposium on Discrete Algorithms (SODA), ACM-SIAM, Jan. 2005.
11. E. D. DEMAINE, F. V. FOMIN, M. T. HAJIAGHAYI, AND D. M. THILIKOS, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, Journal of the ACM, 52 (2005), pp. 866-893.
12. E. D. DEMAINE AND M. HAJIAGHAYI, Graphs excluding a fixed minor have grids as large as trefiwidth, with combinatorial and algorithmic applications through bidimensionality, in 15th Symposium on Discrete Algorithms (SODA), ACM-SIAM, Jan. 2005, pp. 682-689.
13. R. DIESTEL AND R. THOMAS, Excluding a countable clique, Journal of Combinatorial Theory, Series B, 76 (1999), pp. 41-67.
14. H. N. DJIDJEV AND S. M. VENKATESAN, Reduced constants for simple cycle graph separation, Acta Informatica, 34 (1997), pp. 231-243.
15. P. DUCHON, N. HANUSSE, E. LEBHAR, AND N. SCHABANEL, Could any graph be turned into a simall-world?, Research Report 2004-62, LIP, École Normale Supérieure de Lyon, Dec. 2004.
16. _, Could any graph be turned into a small-world?, Theoretical Computer Science, 355 (2006), pp. 96-103.
17. U. FEIGE, M. HAJIAGHAYI, AND J. R. LEE, Improved approximation algorithms for minimum-weight vertex separators, in 37th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, May 2005.
18. P. FLOCCHINI AND F. L. LUCCIO, A new compact routing technique, on series parallel networks, Theory of Computing Systems, 36 (2003), pp. 137-157.
19. P. FRAIGNIAUD, A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs, in 13th Annual European Symposium on Algorithms (ESA), vol. 3669 of LNCS, Springer, Oct. 2005, pp. 791-802.
20. P. FRAIGNIAUD AND C. GAVOILLE, Routing in trees, in 28th International Colloquium on Automata, Languages and Programming (ICALP), vol. 2076 of LNCS, Springer, July 2001, pp. 757-772.
21. G. N. FREDERICKSON AND R. JANARDAN, Designing networks with compact routing tables, Algorithmica, 3 (1988), pp. 171-190.
22. _, Efficient message routing in planar networks, SIAM Journal on Computing, 18 (1989), pp. 843-857.
23. B. FU, Theory and application of width bounded geometric separator, in 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), vol. 3884 of LNCS, Springer, Feb. 2006, pp. 277-288.
24. C. GAVOILLE AND M. GENGLER, Space-efficiency of routing schemes of stretch factor three, Journal of Parallel and Distributed Computing, 61 (2001), pp. 679-687.
25. C. GAVOILLE, D. PELEG, S. PÉRENNÉS, AND R. RAZ, Distance labeling in graphs, Journal of Algorithms, 53 (2004), pp. 85-112.
26. J. R. GILBERT, J. P. HUTCHINSON, AND R. E. TARJAN, A separation theorem for graphs of bounded genus, Journal of Algorithms, 5 (1984), pp. 391-407.
27. M. GROHE, Local tree-width, excluded minors, and approximation algorithms, Combinatorica, 23 (2003), pp. 613-632.
28. A. GUPTA, A. KUMAR, AND R. RASTOGI, Traveling with a pez dispenser (or, routing issues in MPLS), SIAM Journal on Computing, 34 (2005), pp. 453-474.
29. J. KLEINBERG, The small-world phenomenon: An algorithmic perspective, in 32nd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, May 2000, pp. 163-170.
30. _, Complex networks and decentralized search algorithms, in International Congress of Mathematicians (ICM), ACM Press, Aug. 2006. To appear.
31. T. KLOKS, Treewidth: Computations and Approximations, vol. 842 of LNCS, Springer-Verlag, June 1994.
32. K. A. LAING, Brief announcement: Name-independent compact routing in trees, in 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2004, pp. 382-382.
33. R. J. LIPTON AND R. E. TARJAN, A separatortheorem for planar graphs, SIAM Journal on Applied Mathematics, 36 (1979), pp. 177-189.
34. B. MOHAR AND C. THOMASSEN, Graphs on Surfaces, The Johns Hopkins university Press, 2001.
35. S. A. PLOTKIN, S. B. RAO, AND W. D. SMITH, Shallow excluded minors and improved graph decomposition, in 5th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 1994, pp. 462-470.
36. B. REED AND D. R. WOOD, A linear time algorithm to find a separation in a, graph with, an excluded minor, 2005. Full version of EuroComb '05.
37. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. V. Excluding a planar graph, Journal of Combinatorial Theory, Series B, 41 (1986), pp. 92-114.
38. _, Graph minors. XIII. The disjoint paths problem, Journal of Combinatorial Theory, Series B, 63 (1995), pp. 65-110.
39. _, Graph minors. XVI. Excluding a non-planar graph, Journal of Combinatorial Theory, Series B, 89 (2003), pp. 43-76.
40. N. ROBERTSON, P. D. SEYMOUR, AND R. THOMAS, Quickly excluding a planar graph, Journal of Combinatorial Theory, Series B, 62 (1994), pp. 323-348.
41. A. SLIVKINS, Distance estimation and object location via rings of neighbors, in 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, July 2005, pp. 41-50. Appears earlier as Cornell CIS technical report TR2005-1977.
42. K. TALWAR, Bypassing the embedding: Algorithms for low dimensional metrics, in 36th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, June 2004, pp. 281-290.
43. A. THOMASON, The extremal function for complete minors, Journal of Combinatorial Theory, Series B, 81 (2001), pp. 318-338.
44. M. THORUP, Compact oracles for reachability and approximate distances in planar digraphs, Journal of the ACM, 51 (2004), pp. 993-1024.
45. M. THORUP AND U. ZWICK, Approximate distance oracles, Journal of the ACM, 52 (2005), pp. 1-24.