2421 search results - page 46 / 485 » Approximate Flow-Aware Networking |
123
Voted
APPROX
1998
Springer
15 years 6 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
119
click to vote
IPCO
1993
15 years 3 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
110
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
110
Voted
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...
116
click to vote
ADHOCNOW
2004
Springer
15 years 8 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...