Self-adjusting grid networks to minimize expected path length

DOI10.1016/j.tcs.2014.11.036zbMath1315.68197OpenAlexW2175675860MaRDI QIDQ2345461

Chen Avin, Bernhard Haeupler, Zvi Lotker, Michael Borokhovich

Publication date: 22 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.11.036

zbMATH Keywords

approximationdistributed algorithmsroutingenergy-efficientminimum-linear-arrangementself-adjusting networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (1)

Demand-aware network designs of bounded degree

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