Optimal message routing without complete routing tables

Authors:
Greg N Frederickson;Ravi Janardan
Affiliations:
Department of Computer Science, Purdue University, West Lafayette, Indiana;Department of Computer Science, Purdue University, West Lafayette, Indiana
Venue:
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Year:
1986

Citing 2
Cited 5

Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
Implicit Data Structures for the Dictionary Problem

Journal of the ACM (JACM)

A new approach to all pairs shortest paths in planar graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A tradeoff between space and efficiency for routing tables

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Deadlock-free multicasting in irregular networks using prefix routing

The Journal of Supercomputing
Algorithms for sensor and ad hoc networks: advanced lectures

Algorithms for sensor and ad hoc networks: advanced lectures
Color constrained combinatorial optimization problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract