-
2
-
-
0027110161
-
Finding minimum-cost flows by double scaling
-
R. Ahuja, A. V. Goldberg, J. Orlin, and R. E. Tarjan. Finding minimum-cost flows by double scaling. Mathematical Programming, 53:243-266, 1992.
-
(1992)
Mathematical Programming
, vol.53
, pp. 243-266
-
-
Ahuja, R.1
Goldberg, A.V.2
Orlin, J.3
Tarjan, R.E.4
-
3
-
-
0003515463
-
-
Prentice Hall
-
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
-
(1993)
Network Flows: Theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orlin, J.B.3
-
4
-
-
0034288747
-
The graph voronoi diagram with applications
-
Martin Erwig and Fernuniversitat Hagen. The graph voronoi diagram with applications. Networks, 36:156-163, 2000.
-
(2000)
Networks
, vol.36
, pp. 156-163
-
-
Erwig, M.1
Hagen, F.2
-
7
-
-
0001852170
-
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm
-
A. V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22(1):1-29, 1997. (Pubitemid 127451786)
-
(1997)
Journal of Algorithms
, vol.22
, Issue.1
, pp. 1-29
-
-
Goldberg, A.V.1
-
8
-
-
0001764412
-
Solving minimum-cost flow algorithms by successive approximation
-
A. V. Goldberg and R. E. Tarjan. Solving minimum-cost flow algorithms by successive approximation. Mathematics of Operations Research, 15(3):430-466, 1990.
-
(1990)
Mathematics of Operations Research
, vol.15
, Issue.3
, pp. 430-466
-
-
Goldberg, A.V.1
Tarjan, R.E.2
-
10
-
-
0034138344
-
The quickest transshipment problem
-
Bruce Hoppe and E. Tardos. The quickest transshipment problem. Math. Oper. Res., 25(1):36-62, 2000.
-
(2000)
Math. Oper. Res.
, vol.25
, Issue.1
, pp. 36-62
-
-
Hoppe, B.1
Tardos, E.2
-
11
-
-
33845708421
-
A survey on wireless multimedia sensor networks
-
DOI 10.1016/j.comnet.2006.10.002, PII S1389128606002751
-
K. R. Chowdhury I. F. Akyildiz, T. Melodia. A survey on wireless multimedia sensor networks. Computer Networks, 51(4):921-960, 2007. (Pubitemid 44970020)
-
(2007)
Computer Networks
, vol.51
, Issue.4
, pp. 921-960
-
-
Akyildiz, I.F.1
Melodia, T.2
Chowdhury, K.R.3
-
13
-
-
1142299772
-
Algorithms for data migration with cloning
-
ACM Press
-
Samir Khuller and Yoo ah Kim. Algorithms for data migration with cloning. In SIAM Journal on Computing, pages 27-36. ACM Press, 2003.
-
(2003)
SIAM Journal on Computing
, pp. 27-36
-
-
Khuller, S.1
Kim, Y.A.2
-
14
-
-
50149111142
-
Density-based anycast: A robust routing strategy for wireless ad hoc networks
-
V. Lenders, M. May, and B. Plattner. Density-based anycast: A robust routing strategy for wireless ad hoc networks. IEEE/ACM Transactions on Networking, 16:852-863, 2008.
-
(2008)
IEEE/ACM Transactions on Networking
, vol.16
, pp. 852-863
-
-
Lenders, V.1
May, M.2
Plattner, B.3
-
15
-
-
60149098470
-
Capacity of large scale wireless networks under gaussian channel model
-
S. Li, Y. Liu, and X. Li. Capacity of large scale wireless networks under gaussian channel model. In Proc. of MOBICOM 2008.
-
Proc. of MOBICOM 2008
-
-
Li, S.1
Liu, Y.2
Li, X.3
-
16
-
-
77953296190
-
Distributed monitoring and aggregation in wireless sensor networks
-
Changlei Liu and Guohong Cao. Distributed monitoring and aggregation in wireless sensor networks. In Proc. of Infocom 2010.
-
Proc. of Infocom 2010
-
-
Liu, C.1
Cao, G.2
-
17
-
-
67651024192
-
Design, implementation, and evaluation of enviromic: A storage-centric auio sensor network
-
L. Luo, Q. Cao, C. Huang, L. Wang, T. Abdelzaher, and J. Stankovic. Design, implementation, and evaluation of enviromic: A storage-centric auio sensor network. ACM Transactions on Sensor Networks, 5(3):1-35, 2009.
-
(2009)
ACM Transactions on Sensor Networks
, vol.5
, Issue.3
, pp. 1-35
-
-
Luo, L.1
Cao, Q.2
Huang, C.3
Wang, L.4
Abdelzaher, T.5
Stankovic, J.6
-
20
-
-
25644453481
-
Electricfield-based routing: A reliable framework for routing in manets
-
N. T. Nguyen, A.-I. A. Wang, P. Reiher, and G. Kuenning. Electricfield-based routing: A reliable framework for routing in manets. ACM Mobile Computing and Communications Review, 8(2):35-49, 2004.
-
(2004)
ACM Mobile Computing and Communications Review
, vol.8
, Issue.2
, pp. 35-49
-
-
Nguyen, N.T.1
Wang, A.-I.A.2
Reiher, P.3
Kuenning, G.4
-
21
-
-
0027554501
-
A faster stronly polynomial minimum cost flow algorithm
-
J. Orlin. A faster stronly polynomial minimum cost flow algorithm. Operations Research, 41(2):338-466, 1990.
-
(1990)
Operations Research
, vol.41
, Issue.2
, pp. 338-466
-
-
Orlin, J.1
-
24
-
-
84942436269
-
Data mules: Modeling a three-tier architecture for sparse sensor networks
-
Rahul C. Shah, Sumit Roy, Sushant Jain, and Waylon Brunette. Data mules: Modeling a three-tier architecture for sparse sensor networks. In Proc. of SNPA 2003.
-
Proc. of SNPA 2003
-
-
Rahul, C.1
Shah, S.R.2
Jain, S.3
Brunette, W.4
-
27
-
-
51349133751
-
T-lohi: A new class of mac protocols for underwater acoustic sensor networks
-
Affan A. Syed, Wei Ye, and John Heidemann. T-lohi: A new class of mac protocols for underwater acoustic sensor networks. In Proc. of INFOCOM 2008.
-
Proc. of INFOCOM 2008
-
-
Syed, A.A.1
Ye, W.2
Heidemann, J.3
-
28
-
-
51249170715
-
A strongly polynomial minimum cost circulation algorithm
-
E. Tardos. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3):247-255, 1985.
-
(1985)
Combinatorica
, vol.5
, Issue.3
, pp. 247-255
-
-
Tardos, E.1
-
29
-
-
36649005786
-
Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics
-
S. Toumpis. Mother nature knows best: A survey of recent results on wireless networks based on analogies with physics. Computer Networks, 52:360-383, 2008.
-
(2008)
Computer Networks
, vol.52
, pp. 360-383
-
-
Toumpis, S.1
-
30
-
-
78650981339
-
Data collection, storage, and retrieval with an underwater sensor network
-
I. Vasilescu, K. Kotay, D. Rus, M. Dunbabin, and P. Corke. Data collection, storage, and retrieval with an underwater sensor network. In Proc. of SenSys 2005.
-
Proc. of SenSys 2005
-
-
Vasilescu, I.1
Kotay, K.2
Rus, D.3
Dunbabin, M.4
Corke, P.5
|