| |
Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Nonnumerical Algorithms And Problems (F.2.2) > Routing And Layout (F.2.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 22
Reviews about "Routing And Layout (F.2.2...)":
|
Date Reviewed |
| |
Space-efficient path-reporting approximate distance oracles
Elkin M., Neiman O., Wulff-Nilsen C. Theoretical Computer Science 651(C): 1-10, 2016. Type: Article
Graph spanners are sparse subgraphs that preserve distances between nodes of the original graph to an approximation that is bounded, usually given in the form of a multiplication factor known as stretch. Such spanners have application ...
|
Feb 10 2017 |
| |
On Nash equilibria for multicast transmissions in ad-hoc wireless networks
Bilò V., Flammini M., Melideo G., Moscardelli L. Wireless Networks 14(2): 147-157, 2008. Type: Article
This is a study of a multicast game in ad-hoc wireless networks. In studying such games, an objective is to achieve a solution, called a Nash equilibrium, in which no player can increase his benefit by choosing to adopt a different str...
|
Sep 4 2008 |
| |
An effective randomized QoS routing algorithm on networks with inaccurate parameters
Jianxin W., Jian’er C., Songqiao C. Journal of Computer Science and Technology 17(1): 38-46, 2002. Type: Article
In the last few years, various quality of service (QoS) routing algorithms have been proposed. There is an assumption in most of these proposals that the information being used to determine the paths is accurate. Ideally, this is not t...
|
Sep 23 2003 |
| |
Scheduling multicasts on unit-capacity trees and meshes
Henzinger M., Leonardi S. Journal of Computer and System Sciences 66(3): 567-611, 2003. Type: Article
Future high-speed communication networks that use bandwidth reservation for quality-of-service guarantees depend greatly on multicast routing and admission control mechanisms. This paper presents a study of both the offline and the onl...
|
Sep 22 2003 |
| |
On-line single-server dial-a-ride problems
Feuerstein E., Stougie L. Theoretical Computer Science 268(1): 91-105, 2001. Type: Article
The dial-a-ride problem requires an algorithm for satisfying a set P of requests for “rides” in a minimum time. A request r specifies a source sr ...
|
Jul 19 2002 |
| |
Isomorphism of Degree Four Cayley Graph and Wrapped Butterfly and Their Optimal Permutation Routing Algorithm
Wei D., Felix P I., Naik K. IEEE Transactions on Parallel and Distributed Systems 10(12): 1290-1298, 1999. Type: Article
First, this paper shows that the Cayley graph of degree four on n 2n vertices is isomorphic to the n-dimensional wrapped butterfly network, a result published three years earlier by the ...
|
Mar 1 2000 |
| |
Gossiping on Meshes and Tori
Juurlink B., Sibeyn J., Rao P. IEEE Transactions on Parallel and Distributed Systems 9(6): 513-525, 1998. Type: Article
In collective communications operations, gossiping is an important communication problem that refers to the situation in which every processor sends the same message to every other processor in a parallel or distributed system. Gossipi...
|
Apr 1 1999 |
| |
Embedding Torus on the Star Graph
Saikia D., Badrinath R., Sen R. IEEE Transactions on Parallel and Distributed Systems 9(7): 650-663, 1998. Type: Article
The problem of simulating one scheme for the interconnection of nodes on another is important in parallel computing and is essentially graph-theoretic. The star graph of order n has n ! vertices co...
|
Dec 1 1998 |
| |
Efficient delay routing
Di Ianni M. Theoretical Computer Science 196(1-2): 131-151, 1998. Type: Article
The computational complexity of packet routing schemes that are provably efficient with respect to end-to-end delay is considered. This work focuses on finding algorithms that can optimize both the end-to-end delay when the number of p...
|
Nov 1 1998 |
| |
Efficient routing in optical networks
Aggarwal A., Bar-Noy A., Coppersmith D., Ramaswami R., Schieber B., Sudan M. Journal of the ACM 43(6): 973-1001, 1996. Type: Article
The authors clearly describe models of optical networks and prove several upper and lower bounds, using a broad range of techniques. They also pose some good open problems....
|
Oct 1 1997 |
| |
|
|
| |
|
|
