1127 search results - page 136 / 226 » New Algorithms for Generalized Network Flows |
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
ISPASS
2006
IEEE
15 years 4 months ago
2006
IEEE
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
107
Voted
CORR
2010
Springer
14 years 5 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
112
Voted
ADHOC
2007
14 years 11 months ago
2007
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...