Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
As more and more multi-tier services are developed from commercial components or heterogeneous middleware without the source code available, both developers and administrators nee...
Zhihong Zhang, Jianfeng Zhan, Yong Li, Lei Wang, D...
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
LQGraph implements methods for optimizing the connectivity of sites administered to protect biodiversity (a conservation area network). The methods are suitable for existing prote...