11348 search results - page 123 / 2270 » On time-scale designs for networks |
168
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
123
click to vote
ICC
2007
IEEE
16 years 21 days ago
2007
IEEE
—We consider the problem of designing a network which minimizes the total cost of the switching facilities and the fiber links, by choosing the subset of nodes at which to insta...
335
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
Abstract— We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix,...
158
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we give the first constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in la...