A dynamic location problem for graphs

DOI10.1007/BF02124674zbMATH Open0692.05055OpenAlexW1976753172WikidataQ56288399 ScholiaQ56288399MaRDI QIDQ583245FDOQ583245

Authors: Fan Chung, Ron Graham, Michael Saks 

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02124674

Recommendations

• scientific article; zbMATH DE number 714106
• Sequential location-allocation problems on chains and trees with probabilistic link demands
• scientific article; zbMATH DE number 4049076
• Recognizing median graphs in subquadratic time
• Locations on time-varying networks

zbMATH Keywords

graphswindexmyopicdynamic location problemon line algorithmswindow index

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Addressing Problem for Loop Switching
• Median algebras
• Vertex-to-vertex pursuit in a graph
• Infinite median graphs, (0, 2)-graphs, and hypercubes
• n‐cubes and median graphs
• On self-organizing sequential search heuristics
• Distance-preserving subgraphs of hypercubes
• On Isometric Embeddings of Graphs
• An optimal on-line algorithm for metrical task system
• Metric Ternary Distributive Semi-Lattices
• Graphs Orientable as Distributive Lattices
• Fixed-edge theorem for graphs with loops
• Title not available (Why is that?)
• ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
• On Serial Files with Relocatable Records
• Median graphs and Helly hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-organizing sequential search and Hilbert's inequalities
• Heuristics That Dynamically Organize Data Structures
• The smallest graph variety containing all paths
• On a class of isometric subgraphs of a graph
• Amortized Computational Complexity
• Pursuit—Evasion games on graphs
• Join-semilattices and simple graphic algebras
• Title not available (Why is that?)
• Optimal list order under partial memory constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (28)

• On the natural imprint function of a graph
• Clique-gated graphs
• A competitive analysis of the list update problem with lookahead
• A new fixed point approach for stable networks and stable marriages
• An on-line graph coloring algorithm with sublinear performance ratio
• A Helly theorem in weakly modular space
• Title not available (Why is that?)
• Dynamic resource location with tropical algebra
• Lower bounds for on-line graph coloring
• Decomposition and \(l_1\)-embedding of weakly median graphs
• Dynamic location problems with limited look-ahead
• Invariant Hamming graphs in infinite quasi-median graphs
• An ABC-problem for location and consensus functions on graphs
• The algebra of metric betweenness. I: Subdirect representation and retraction
• The retracts of Hamming graphs
• Coloring inductive graphs on-line
• Generalized Hamming graphs: some new results
• Tree-like partial Hamming graphs
• Title not available (Why is that?)
• Parametrized relocation of low‐mobility resources
• Recognizing median graphs in subquadratic time
• A Competitive analysis of the list update problem with lookahead
• Cartesian products of block graphs
• Retracts of infinite Hamming graphs
• Quasi-median graphs, their generalizations, and tree-like equalities
• Skeletons, recognition algorithm and distance matrix of quasi-median graphs
• Hamming polynomials and their partial derivatives
• Cost thresholds for dynamic resource location

This page was built for publication: A dynamic location problem for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583245)