Abstract
We introduce a class of optimization problems, calleddynamic location problems, involving the processing of requests that occur sequentially at the nodes of a graphG. This leads to the definition of a new parameter of graphs, called the window indexWX(G), that measures how large a “window” into the future is needed to solve every instance of the dynamic location problem onG optimally on-line. We completely characterize this parameter:WX(G)≦k if and only ifG is a weak retract of a product of complete graphs of size at mostk. As a byproduct, we obtain two (polynomially recognizable) structural characterizations of such graphs, extending a result of Bandelt.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Assouad, Un espace hypermétrique non plongeable dans un espaceL, C. R. Acad. Sci. Paris,286 (ser. A) (1977), 361–363.
P. Assouad andC. Delorme, Graphs plongeables dansL, C. R. Acad. Sci. Paris,291 (1980), 369–372.
S. P. Avann, Metric ternary distributive semi-lattices,Proc. Amer. Math. Soc.,12 (1961), 407–414.
H. J.Bandelt, Retracts of hypercubes,preprint.
H. J. Bandelt andJ. Hedliková, Median algebras,Discrete Math. 45 (1983), 1–30.
J. R.Bitner, Heuristics that dynamically alter data structure to reduce theirs access time, Ph. D. Thesis, Univ. of Illinios, (1976).
J. R. Bitner, Heuristics that dynamically organize data structures,SIAM J. Comp.,8 (1979), 82–110.
A.Borodin, N.Linial and M.Saks, An optimal online algorithm for metrical task systems,Proc. 19th ACM Symposium on Theory of Computing, 1987 (to appear).
H. J.Bandelt and H. M.Mulder, Infinite mediam graphs, (0,2)-graphs and hypercubes.J. Graph Theory (to appear).
J. L.Bentley, C. C.McGeoch, Worst-case analyses of self-organizing sequential search heuristics,Proc. 20thAllerton Conference on Communication, Control and Computing.
F. R. K. Chung, J. Cohen andR. L. Graham, Pursuit-evasion in graphs,Journal of Graph Theory 12 (1980), 159–167.
F. R. K.Chung, R. L.Graham and M. E.Saks, Dynamic Search in Graphs, in Discrete Algorithms and Complexity, Academic Press (1987), 351–388.
F. R. K.Chung, D. J.Hajela and P.Seymour, Self-organizing sequential search and Hilbert's inequality, Proc. 17th ACM Symposium on Theory of Computing (1985), 217–223.
A. K. Dewdney, The embedding dimension of a graph,Ars Combinatoria,9 (1980), 77–90.
D. Z. Djokovič, Distance preserving subgraphs of hypercubes,J. Comb. Th. (B),14 (1973), 263–267.
D. Duffus andI. Rival, Graphs orientable as distributive lattices,Proc. Amer. Math. Soc. 88 (1983), 197–200.
E.Evans, Median lattices and convex subalgebras, Colloq. Math. Soc. János Bolyai, 29Universal algebra (1982), 225–240.
V. Firsov, Isometric embedding of a graph in a Boolean cube,Kibernetica (Kiev),1 (1965), 95–96.
R. L.Graham, On isometric embeddings of graphs, in Proc. of Silver Jubilee Conference on Combinatorics, Waterloo University, 1984.
R. L. Graham, On primitive graphs and optimal vertex assignments,NY Acad. Sci. 175 (1970), 170–186.
G.Gonnet, J. I.Munro and H.Suwanda, Toward self-organizing sequential search heuristics, Proc 20th IEEE Symp. Foundations Computer-Science, (1979), 169–174.
R. L. Graham andH. O. Pollak, On the addressing problem for loop switching,Bell Sys. Tech. Jour.,50 (1971), 2495–2519.
R. L. Graham andH. O. Pollak, On embedding graphs in squashed cubes,Graph Theory and Applications, in Lecture Notes in Math. No. 303, Springer-Verlag, New York, 1972, 99–110.
R. L. Graham andP. M. Winkler, On isometric embeddings of graphs,Transactions Amer. Math. Soc.,288 (1985), 527–539.
P.Hell, Rétractions de graphes, Ph. D. thesis, Université de Montréal, 1972.
P. Hell, Absolute planar retracts and the four color conjecture,J. Combinatorial Theory,17 (1974), 5–10.
P. Hell, Absolute retracts in graphs, Springer-Verlag, New York, Lecture Notes Math.,406 (1974), 291–301.
P.Hell, Graph retractions, Colloq. Intern. Teorie Combinatories II, Roma, 1976, 263–268.
J. R. Isbell, Mediam algebra,Trans. Amer. Math. Soc.,260 (1980), 319–362.
D. E. Knuth, The Art of Computer Programming Vol. 3, Sorting and Searching, Addison-Wesley, Reading, MA (1973), 398–399.
Y. C. Kan andS. M. Ross, Optimal list under partial memory constraints,J. Appl. Prob.,17 (1980), 1004–1015.
J. McCabe, On serial file with relocatable records,Oper. Res.,12 (1965), 609–618.
H. M. Mulder, The structure of median graphs,J. Graph Theory,4 (1980), 107–110.
H. M. Mulder,n-Cubes and median graphs,J. Graph Theory,4 (1980), 107–110.
H. M. Mulder andA. Schrijver, Median graphs and Helly hypergraphs.Discrete Math.,25 (1979), 41–50.
L. Nebeský, Median graphs,Comment. Math., Univ. Carolina,12 (1971), 317–325.
J. Nieminen, Join-semilattices and simple graphic algebras,Math. Nachr.,77 (1977), 87–91.
R. Nowakowski andI. Rival, Fixed-edge theorem for graphs with loops,J. Graph Theory,3 (1979), 339–350.
R. Nowakowski andI. Rival, On a class of isometric subgraphs of a graph,Combinatorica,2 (1982), 79–90.
R. Nowakowski andI. Rival, The smallest graph variety containing all paths,Discrete Math.,43 (1983), 223–234.
R. Nowakowski andP. Winkler, Vertex-to-vertex pursuit in a graph,Discrete Math. 43 (1983), 235–239.
C.Papadimitriou and K.Steiglitz,Combinatorial Optimization, Prentice Hall, 1982.
R. Rivest, On self-organizing sequential search heuristics,CACM,19 (1976), 63–67.
D. D. Sleator andR. E. Tarjan, Amortized efficiency of list update and paging rules,Comm. ACM 28 (1985), 205–208.
R. E. Tarjan, Amortized computational complexity,SIAM, J. Alg. Disc. Meth.,6 (1985), 306–318.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chung, F.R.K., Graham, R.L. & Saks, M.E. A Dynamic location problem for graphs. Combinatorica 9, 111–131 (1989). https://doi.org/10.1007/BF02124674
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02124674