Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem

Authors:
Lyle Andrew Mcgeoch
Affiliations:
-
Venue:
Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem
Year:
1987

Citing 0
Cited 3

Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Competitive randomized algorithms for non-uniform problems

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A New Competitive Analysis of Randomized Caching

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract