Self-adjusting grid networks to minimize expected path length
DOI10.1016/J.TCS.2014.11.036zbMATH Open1315.68197OpenAlexW2175675860MaRDI QIDQ2345461FDOQ2345461
Authors: Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker 
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
Recommendations
approximationdistributed algorithmsroutingenergy-efficientminimum-linear-arrangementself-adjusting networks
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Cites Work
- Optimization by simulated annealing
- Collective dynamics of `small-world' networks
- Title not available (Why is that?)
- Self-adjusting binary search trees
- A framework for solving VLSI graph layout problems
- Minimum congestion mapping in a cloud
- A self-stabilizing and local Delaunay graph construction
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- An adaptive routing strategy for packet delivery in complex networks
- The complexity of minimizing wire lengths in VLSI layouts
- Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
- Topology-aware VM migration in bandwidth oversubscribed datacenter networks
Cited In (3)
This page was built for publication: Self-adjusting grid networks to minimize expected path length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345461)
