B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1):263-277, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Application-oriented Self-organizing Hierarchical.. - Richa, Obraczka, Sen (Correct)
....for 2hop clusters in ad hoc networks. Various aspects of clustering in radio network design have been examined in [11, 9, 12, 10] Ecient clustering techniques, which rely on signi cant cluster overlap in order to guarantee communication performance bounds were developed by Awerbuch et al. in [7, 5]. Their work has been extensively used (e.g. 5, 6, 13, 8] in designing ecient algorithms in the context of several network applications, including routing. Their techniques apply to a static network scenario. Plaxton et al. 43] and Rajaraman et al. 45] focus on the issues that relate to data ....
.... of clustering in radio network design have been examined in [11, 9, 12, 10] Ecient clustering techniques, which rely on signi cant cluster overlap in order to guarantee communication performance bounds were developed by Awerbuch et al. in [7, 5] Their work has been extensively used (e.g. [5, 6, 13, 8]) in designing ecient algorithms in the context of several network applications, including routing. Their techniques apply to a static network scenario. Plaxton et al. 43] and Rajaraman et al. 45] focus on the issues that relate to data tracking alone, proving e cient performance bounds ....
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near linear time construction of sparse neighborhood covers. SIAM Journal of Computing, vol. 28, no. 1, pages 263-277, 1998.
Subgraph Isomorphism in Planar Graphs and Related Problems - Eppstein (1999) (28 citations) (Correct)
....small diameter. They showed that for any (possibly nonplanar) graph, and any given value w, there is a w neighborhood cover in which the diameter of each subgraph is O(w log n) and in which the total size of all subgraphs is O(m log n) such a cover can be computed in time O(m log n n log n) [4]. Because of Lemma 4, such a neighborhood cover is also almost exactly what we want to speed up our subgraph isomorphism algorithm. However there are two problems. First, the size and construction time of neighborhood covers are higher than we want (albeit only by polylogarithmic factors) ....
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM J. Computing 28(1):263{ 277, 1998.
Optimum Binary Search Trees On The Hierarchical Memory Model - Thite (2001) (2 citations) (Correct)
....of algorithms that operate on large matrices [CS] A successful strategy is to partition the matrix into rectangular blocks, each block small enough to t entirely in main memory or cache, and operate on the blocks independently. The same blocking strategy has been employed for graph algorithms [ABCP98, CGG 95, NGV96] The idea is to cover an input graph with subgraphs; each subgraph is a small diameter neighborhood of vertices just big enough to t in main memory. A computation on the entire graph can be performed by loading each neighborhood subgraph into main memory in turn, computing ....
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1):263-277, 1998.
Subgraph Isomorphism in Planar Graphs and Related Problems - Eppstein (1995) (28 citations) (Correct)
....and any given value w, there is a w neighborhood cover in which the diameter of each subgraph is O(w log n) and in which the D. Eppstein, Planar Subgraph Isomorphism, JGAA, 3(3) 1 27 (1999) 10 total size of all subgraphs is O(m log n) such a cover can be computed in time O(m log n n log 2 n) [4]. Because of Lemma 4, such a neighborhood cover is also almost exactly what we want to speed up our subgraph isomorphism algorithm. However there are two problems. First, the size and construction time of neighborhood covers are higher than we want (albeit only by polylogarithmic factors) Second, ....
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM J. Computing 28(1):263{ 277, 1998.
Piecemeal Graph Exploration by a Mobile Robot - Awerbuch, Betke, Rivest (1995) (12 citations) Self-citation (Awerbuch) (Correct)
No context found.
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal of Computing, 28(1):254--262, 1998.
Compact Routing with Minimum Stretch - Cowen (40 citations) Self-citation (Cowen) (Correct)
...., where jd(u; v)j is the length of the shortest u Gamma v path. The approximate all pairs shortest path problem involves a tradeoff of stretch against time short paths with stretch bounded by a constant are computed in time less than it would take to compute exact all pairs shortest paths (see [1, 2, 6, 8, 9, 10]) The compact routing problem considers instead a tradeoff of stretch for space, in the setting where each node locally stores its own routing tables. The stretch of a compact routing algorithm is defined as the maximum stretch over the routes for all pairs of nodes in the network. Clearly if ....
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Nearlinear time construction of sparse neighborhood covers. SIAM J. on Comput., 28(1):263--277, 1999.
Compact Roundtrip Routing for Digraphs - Cowen, Wagner (1999) (1 citation) Self-citation (Cowen) (Correct)
....may be longer that the shortest path between the nodes. The compact routing problem instead considers a tradeoff of route lengths for space, in the setting where each node locally stores its own routing tables. Much recent work has been done on fast constructions of approximate shortest paths (see [1, 2, 5, 7, 8, 10]) and on compact routing schemes with sublinear maximum or average space (see [3, 4, 6, 9, 11, 13, 14] for undirected weighted and unweighted graphs. However, there have been no previous schemes that achieved any savings of time or space over the exact schemes for either weighted or unweighted ....
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM J. on Comput., 28(1):263--277, 1999.
Optimum Binary Search Trees On The Hierarchical Memory Model - Shripad Thite University (2001) (2 citations) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1):263-277, 1998.
Dynamic Approximate All-Pairs Shortest Paths In Undirected Graphs - Roditty, Zwick (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263--277, 1999.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263--277, 1999.
Application-oriented Self-organizing Hierarchical.. - Richa, Obraczka, Sen (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near linear time construction of sparse neighborhood covers. SIAM Journal of Computing, vol. 28, no. 1, pages 263-277, 1998.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM J. Computing, 28:263--277, 1999.
All-Pairs Small-Stretch Paths - Cohen, Zwick (2000) (6 citations) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263--277, 1999.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263-277, 1999.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263--277, 1999.
Graph Distances in the Streaming Model: The Value of Space - Feigenbaum, Kannan.. (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg, Nearlinear time construction of sparse neighborhood covers, SIAM Journal on Computing 28 (1998), no. 1, 263--277.
A Linear Time Distributed Algorithm for Graph Decomposition - Derbel, Mosbah (2004) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263--277, 1998.
Roundtrip Spanners and Roundtrip Routing in Directed Graphs - Roditty, Thorup, Zwick (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28:263-277, 1999. A preliminary version appears at the proceedings of FOCS'93.
Approximation Algorithms for Clustering to.. - Doddi, Marathe.. (2000) (1 citation) (Correct)
No context found.
B. Awerbuch, B. Berger, L. Cowen and D. Peleg, "Near-Linear Time Construction of Sparse Neighborhood Covers", SIAM J. Computing, Vol. 28, No. 1, 1998, pp. 263--277.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC