{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T01:27:25Z","timestamp":1730251645045,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/icnidc.2012.6418763","type":"proceedings-article","created":{"date-parts":[[2013,1,30]],"date-time":"2013-01-30T17:53:56Z","timestamp":1359568436000},"page":"294-298","source":"Crossref","is-referenced-by-count":1,"title":["Research based on the specific optimizing strategy for network flow monitoring"],"prefix":"10.1109","author":[{"given":"Xinjian","family":"Zhuo","sequence":"first","affiliation":[]},{"given":"Xiaojie","family":"Cao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","article-title":"A monitoring model for link bandwidth usage of network based on weak vertex cover","volume":"15","author":"liu","year":"2004","journal-title":"Journal of Software"},{"journal-title":"Efficiently Monitoring Bandwidth and Latency in IP Network","year":"2000","author":"breibart","key":"2"},{"key":"10","article-title":"Competitive decision algorithm for minimum vertex cover problem","volume":"47","author":"jn","year":"2011","journal-title":"Computer Engineering and Applications"},{"key":"1","article-title":"Measuring bandwidth","author":"lai","year":"1999","journal-title":"New York Proceedings of the IEEE INFOCOM"},{"key":"7","article-title":"Greedy algorithm's design and analysis of vertex cover problem","volume":"29","author":"yao","year":"2001","journal-title":"Journal of Fuzhou University (Natural Science)"},{"journal-title":"Introduction to Algorithms","year":"2002","author":"thomas","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"4","article-title":"Model and algorithm research for seeking efficient monitor- nodes measuring network traffic","volume":"28","author":"jiang","year":"2006","journal-title":"Journal of electronics &Information Technology"},{"key":"9","article-title":"Fast reduction algorithm for minimum vertex cover problem","volume":"29","author":"ning","year":"2008","journal-title":"Journal of Chinese Computer Systems"},{"key":"8","article-title":"Greedy-edge approximation algorithm of best vertex cover","volume":"29","author":"yang","year":"2006","journal-title":"Journal of Sichuan Normal University(Natural Science)"}],"event":{"name":"2012 3rd IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC 2012)","start":{"date-parts":[[2012,9,21]]},"location":"Beijing, China","end":{"date-parts":[[2012,9,23]]}},"container-title":["2012 3rd IEEE International Conference on Network Infrastructure and Digital Content"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6410480\/6418700\/06418763.pdf?arnumber=6418763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T16:30:35Z","timestamp":1490113835000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6418763\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/icnidc.2012.6418763","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}