Self-adjusting Grid Networks to Minimize Expected Path Length

DOI10.1007/978-3-319-03578-9_4zbMath1406.68002arXiv1110.0196OpenAlexW2089932773MaRDI QIDQ2868630

Zvi Lotker, Bernhard Haeupler, Michael Borokhovich, Chen Avin

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0196

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (1)

Self-adjusting grid networks

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• An adaptive routing strategy for packet delivery in complex networks
• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
• A framework for solving VLSI graph layout problems
• The complexity of minimizing wire lengths in VLSI layouts
• Minimum congestion mapping in a cloud
• Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks
• A Self-stabilizing and Local Delaunay Graph Construction
• Self-adjusting binary search trees
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Self-adjusting Grid Networks to Minimize Expected Path Length