This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Generalization ability of neural networks is very important and a rule of thumb for good generalization in neural systems is that the smallest system should be used to fit the tra...
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Web-based communities have become important places for people to seek and share expertise. We find that networks in these communities typically differ in their topology from other...