Self-adjusting grid networks to minimize expected path length
- 1 June 2015
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 584, 91-102
Abstract
No abstract availableAll Related Versions
This publication has 12 references indexed in Scilit:
- Integer point sets minimizing average pairwisedistance: What is the optimal shape of a town?Computational Geometry, 2011
- Self-adjusting routing schemes for time-varying traffic in scale-free networksPhysical Review E, 2009
- OpenFlowACM SIGCOMM Computer Communication Review, 2008
- Gradient mechanism in a communication networkPhysical Review E, 2008
- An adaptive routing strategy for packet delivery in complex networksPhysics Letters A, 2007
- A survey of graph layout problemsACM Computing Surveys, 2002
- The complexity of minimizing wire lengths in VLSI layoutsInformation Processing Letters, 1987
- Self-adjusting binary search treesJournal of the ACM, 1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Optimization by Simulated AnnealingScience, 1983