We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
A well-documented problem of Catmull and Clark subdivision is that, in the neighborhood of extraordinary point, the curvature is unbounded and fluctuates. In fact, since one of th...
– In this paper, we proposed an improved algorithm for the multi-robot complete coverage problem. Real world applications such as lawn mowing, chemical spill clean-up, and humani...
— The current Domain Name System (DNS) follows a hierarchical tree structure. Several recent efforts proposed to re-implement DNS as a peer-to-peer network with a flat structure...
Vasileios Pappas, Daniel Massey, Andreas Terzis, L...
— In the absence of a cost-effective technology for storing optical signals, emerging optical packet switched (OPS) networks are expected to have severely limited buffering capab...
Vijay Sivaraman, Hossam A. ElGindy, David Moreland...