-
1
-
-
0004116989
-
-
Cambridge, MIT press. ISBN 0-262-03293-7
-
Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. Vol. 2. Cambridge: MIT press, 2001. ISBN 0-262-03293-7.
-
(2001)
Introduction to Algorithms
, vol.2
-
-
Cormen, T.H.1
Leiserson, C.E.2
Rivest, R.L.3
Stein, C.4
-
3
-
-
70349329919
-
Articulation node based routing in delay tolerant networks
-
IEEE
-
Ding, Li, Bo Gu, Xiaoyan Hong, and Brandon Dixon. "Articulation node based routing in delay tolerant networks." In Pervasive Computing and Communications, 2009. PerCom 2009. IEEE International Conference on, pp. 1-6. IEEE, 2009.
-
(2009)
Pervasive Computing and Communications 2009. PerCom 2009 IEEE International Conference on
, pp. 1-6
-
-
Li, D.1
Gu, B.2
Hong, X.3
Dixon, B.4
-
4
-
-
77649302121
-
An approximation algorithm for weak vertex cover problem in IP network traffic measurement." InNetwork
-
IEEE
-
Zeng, Yongguo, Dezheng Wang, Wei Liu, and Ao Xiong. "An approximation algorithm for weak vertex cover problem in IP network traffic measurement." InNetwork Infrastructure and Digital Content, 2009. IC-NIDC 2009. IEEE International Conference on, pp. 182-186. IEEE, 2009.
-
(2009)
Infrastructure and Digital Content 2009. IC-NIDC 2009 IEEE International Conference on
, pp. 182-186
-
-
Yongguo, Z.1
Wang, D.2
Liu, W.3
Xiong, A.4
-
5
-
-
13944283393
-
A survey on routing protocols for wireless sensor networks
-
Akkaya, Kemal, and Mohamed Younis. "A survey on routing protocols for wireless sensor networks." Ad hoc networks 3, no. 3 (2005): 325-349.
-
(2005)
Ad Hoc Networks
, vol.3
, Issue.3
, pp. 325-349
-
-
Kemal, A.1
Younis, M.2
-
6
-
-
85026969119
-
A near optimal approximation algorithm for vertex-cover problem
-
Puthal, Deepak. "A Near Optimal Approximation Algorithm for Vertex-Cover Problem." arXiv preprint arXiv:1309.4953, 2013.
-
(2013)
ArXiv Preprint arXiv:1309
, vol.4953
-
-
Deepak, P.1
-
8
-
-
26444578215
-
A better approximation ratio for the vertex cover problem
-
Karakostas, George. "A better approximation ratio for the vertex cover problem." In Automata, languages and programming, pp. 1043-1050, 2005.
-
(2005)
Automata, Languages and Programming
, pp. 1043-1050
-
-
George, K.1
-
9
-
-
76649088030
-
A better approximation ratio for the vertex cover problem
-
Karakostas, George. "A better approximation ratio for the vertex cover problem." ACM Transactions on Algorithms (TALG) Vol. 5(4), pp. 41.1-41.8, 2009.
-
(2009)
ACM Transactions on Algorithms (TALG
, vol.5
, Issue.4
, pp. 411-418
-
-
George, K.1
-
10
-
-
0542433615
-
A local-ratio theorem for approximating the weighted vertex cover problem
-
Bar-Yehuda, Reuven, and Shimon Even. "A local-ratio theorem for approximating the weighted vertex cover problem." North-Holland Mathematics Studies 109, pp. 27-45, 1985.
-
(1985)
North-Holland Mathematics Studies
, vol.109
, pp. 27-45
-
-
Reuven, B.1
Even, S.2
-
11
-
-
0022045936
-
Ramsey numbers and an approximation algorithm for the vertex cover problem
-
Monien, Burkhard, and Ewald Speckenmeyer. "Ramsey numbers and an approximation algorithm for the vertex cover problem." Acta Informatica vol. 22(1), pp. 115-123, 1985.
-
(1985)
Acta Informatica
, vol.22
, Issue.1
, pp. 115-123
-
-
Burkhard, M.1
Speckenmeyer, E.2
-
12
-
-
70349970181
-
Expander flows, geometric embeddings and graph partitioning
-
Arora, Sanjeev, Satish Rao, and Umesh Vazirani. "Expander flows, geometric embeddings and graph partitioning." Journal of the ACM (JACM) Vol. 56(2), 2009.
-
(2009)
Journal of the ACM (JACM)
, vol.56
, pp. 2
-
-
Sanjeev, A.1
Rao, S.2
Vazirani, U.3
-
13
-
-
38149105774
-
Vertex cover might be hard to approximate to within 2
-
Khot, Subhash, and Oded Regev. "Vertex cover might be hard to approximate to within 2." Journal of Computer and System Sciences vol. 74(3), pp. 335-349, 2008.
-
(2008)
Journal of Computer and System Sciences
, vol.74
, Issue.3
, pp. 335-349
-
-
Subhash, K.1
Regev, O.2
-
15
-
-
84870993358
-
Vertex cover in graphs with locally few colors
-
Kuhn, Fabian, and Monaldo Mastrolilli. "Vertex cover in graphs with locally few colors." Information and Computation Vol. 222, pp. 265-277, 2013.
-
(2013)
Information and Computation
, vol.222
, pp. 265-277
-
-
Fabian, K.1
Mastrolilli, M.2
-
16
-
-
20844432847
-
The coverage problem in a wireless sensor network
-
Huang, Chi-Fu, and Yu-Chee Tseng. "The coverage problem in a wireless sensor network." Mobile Networks and Applications vol. 10(4), pp. 519-528, 2005.
-
(2005)
Mobile Networks and Applications
, vol.10
, Issue.4
, pp. 519-528
-
-
Chi-Fu, H.1
Tseng, Y.2
-
17
-
-
84870862069
-
Dynamic model for efficient data collection in wireless sensor networks with mobile sink
-
Puthal, Deepak, Bibhudatta Sahoo, and Suraj Sharma. "Dynamic Model for Efficient Data Collection in Wireless Sensor Networks with Mobile Sink." International Journal of Computer Science and Technology, vol. 3(1), pp. 623-628, 2012.
-
(2012)
International Journal of Computer Science and Technology
, vol.3
, Issue.1
, pp. 623-628
-
-
Deepak, P.1
Sahoo, B.2
Sharma, S.3
-
19
-
-
36849083014
-
Cost-effective outbreak detection in networks
-
ACM
-
Leskovec, Jure, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. "Cost-effective outbreak detection in networks." In Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 420-429. ACM, 2007.
-
(2007)
Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, pp. 420-429
-
-
Jure, L.1
Krause, A.2
Guestrin, C.3
Faloutsos, C.4
VanBriesen, J.5
Glance, N.6
-
20
-
-
70349678474
-
Optimal and scalable distribution of content updates over a mobile social network
-
Ioannidis, Stratis, Augustin Chaintreau, and Laurent Massoulie. "Optimal and scalable distribution of content updates over a mobile social network." InINFOCOM 2009, IEEE, pp. 1422-1430. IEEE, 2009.
-
INFOCOM 2009 IEEE. IEEE
, vol.2009
, pp. 1422-1430
-
-
Stratis, I.1
Chaintreau, A.2
Massoulie, L.3
-
21
-
-
70450161107
-
Multicasting in delay tolerant networks: A social network perspective
-
ACM
-
Gao, Wei, Qinghua Li, Bo Zhao, and Guohong Cao. "Multicasting in delay tolerant networks: A social network perspective." In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, pp. 299-308. ACM, 2009.
-
(2009)
Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing
, pp. 299-308
-
-
Wei, G.1
Li, Q.2
Zhao, B.3
Cao, G.4
-
25
-
-
84959540224
-
-
A Decade in Internet Time: Symposium on the Dynamics of the Internet and Society
-
Boyd, Danah, and Kate Crawford, "Six provocations for big data." A Decade in Internet Time: Symposium on the Dynamics of the Internet and Society, 2011.
-
(2011)
Six Provocations for Big Data
-
-
Danah, B.1
Crawford, K.2
-
26
-
-
84923224316
-
Towards scalable systems for big data analytics: A technology tutorial
-
Hu, Han, Y. O. N. G. G. A. N. G. Wen, T. Chua, and X. U. E. L. O. N. G. Li. "Towards Scalable Systems for Big Data Analytics: A Technology Tutorial." IEEE Access, Vol. 2, pp. 652-687, 2014.
-
(2014)
IEEE Access
, vol.2
, pp. 652-687
-
-
Han, H.1
Wen, Y.2
Chua, T.3
Li, X.4
-
28
-
-
84904539268
-
The digital universe in 2020: Big data, bigger digital shadows, and biggest growth in the far east
-
Gantz, John, and David Reinsel. "The digital universe in 2020: Big data, bigger digital shadows, and biggest growth in the far east." IDC iView: IDC Analyze the Future 2007, pp. 1-16, 2012.
-
(2012)
IDC IView: IDC Analyze the Future 2007
, pp. 1-16
-
-
John, G.1
Reinsel, D.2
-
31
-
-
44449086938
-
Structural analysis of behavioral networks from the Internet
-
Meiss, Mark R., Filippo Menczer, and Alessandro Vespignani. "Structural analysis of behavioral networks from the Internet." Journal of Physics A: Mathematical and Theoretical, vol. 41(22), pp. 224-022, 2008.
-
(2008)
Journal of Physics A: Mathematical and Theoretical
, vol.41
, Issue.22
, pp. 224-322
-
-
Meiss Mark, R.1
Menczer, F.2
Vespignani, A.3
-
32
-
-
84861030751
-
Emergency situation awareness from twitter for crisis management
-
ACM
-
Cameron, Mark A., Robert Power, Bella Robinson, and Jie Yin. "Emergency situation awareness from twitter for crisis management." In Proceedings of the 21st international conference companion on World Wide Web, pp. 695-698. ACM, 2012.
-
(2012)
Proceedings of the 21st International Conference Companion on World Wide Web
, pp. 695-698
-
-
Cameron Mark, A.1
Power, R.2
Robinson, B.3
Yin, J.4
-
33
-
-
70249128691
-
Are you moved by your social network application?
-
ACM
-
Mtibaa, Abderrahmen, Augustin Chaintreau, Jason LeBrun, Earl Oliver, Anna-Kaisa Pietilainen, and Christophe Diot. "Are you moved by your social network application?." In Proceedings of the first workshop on Online social networks, pp. 67-72. ACM, 2008.
-
(2008)
Proceedings of the First Workshop on Online Social Networks
, pp. 67-72
-
-
Abderrahmen, M.1
Chaintreau, A.2
LeBrun, J.3
Oliver, E.4
Pietilainen, A.5
Diot, C.6
-
34
-
-
33745782353
-
Compact reachability labeling for graph-structured data
-
ACM
-
He, Hao, Haixun Wang, Jun Yang, and Philip S. Yu. "Compact reachability labeling for graph-structured data." In Proceedings of the 14th ACM international conference on Information and knowledge management, pp. 594-601. ACM, 2005.
-
(2005)
Proceedings of the 14th ACM International Conference on Information and Knowledge Management
, pp. 594-601
-
-
Hao, H.1
Wang, H.2
Yang, J.3
Yu, P.S.4
-
36
-
-
77954721373
-
Computing label-constraint reachability in graph databases
-
Jin, Ruoming, Hui Hong, Haixun Wang, Ning Ruan, and Yang Xiang. "Computing label-constraint reachability in graph databases." In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 123-134, 2010.
-
(2011)
Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data
, pp. 123-134
-
-
Ruoming, J.1
Hong, H.2
Wang, H.3
Ruan, N.4
Xiang, Y.5
-
37
-
-
79957828078
-
Adding regular expressions to graph reachability and pattern queries
-
Fan, Wenfei, Jianzhong Li, Shuai Ma, Nan Tang, and Yinghui Wu. "Adding regular expressions to graph reachability and pattern queries." In Data Engineering (ICDE), 2011 IEEE 27th International Conference on, pp. 39-50, 2011.
-
(2011)
Data Engineering (ICDE) 2011 IEEE 27th International Conference on
, pp. 39-50
-
-
Wenfei, F.1
Li, J.2
Shuai, M.A.3
Tang, N.4
Wu, Y.5
-
38
-
-
84889678871
-
Energy efficient protocols for wireless sensor networks: A survey and approach
-
Sahoo, B. P. S., Satyajit Rath, and Deepak Puthal. "Energy efficient protocols for wireless sensor networks: A survey and approach." International Journal of Computer Applications, vol. 44(18), pp. 43-48, 2012.
-
(2012)
International Journal of Computer Applications
, vol.44
, Issue.18
, pp. 43-48
-
-
Sahoo, B.P.S.1
Rath, S.2
Puthal, D.3
-
40
-
-
84959497111
-
Secure data collection & critical data transmission in mobile sink WSN: Secure and energy efficient data collection technique
-
ISBN: 978-3-659-
-
Puthal, Deepak, and Bibhudatta Sahoo. "Secure Data Collection & Critical Data Transmission in Mobile Sink WSN: Secure and Energy efficient data collection technique." LAP Lambert Academic Publishing: Germany, 2012. ISBN: 978-3-659-16846-8.
-
(2012)
LAP Lambert Academic Publishing: Germany
, pp. 16846-16848
-
-
Deepak, P.1
Sahoo, B.2
-
41
-
-
84975033887
-
Big data needs approximate computing: Technical perspective
-
Nair, Ravi. "Big data needs approximate computing: Technical perspective."Communications of the ACM vol. 58(1), pp. 104, 2014.
-
(2014)
Communications of the ACM
, vol.58
, Issue.1
, pp. 104
-
-
Ravi, N.1
|