{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:12Z","timestamp":1725745272432},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_7","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T13:17:34Z","timestamp":1376659054000},"page":"81-95","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling Subset Tests: One-Time, Continuous, and How They Relate"],"prefix":"10.1007","author":[{"given":"Edith","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, S., Alonso, R., Franklin, M., Zdonik, S.: Broadcast disks: data management for asymmetric communication environments. In: ACM SIGMOD (1995)","DOI":"10.1145\/223784.223816"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/TCOM.1987.1096659","volume":"35","author":"M. Ammar","year":"1987","unstructured":"Ammar, M., Wong, J.: On the optimality of cyclic transmission in teletext systems. IEEE Tran. Communication\u00a035(1), 68\u201373 (1987)","journal-title":"IEEE Tran. Communication"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1287\/moor.27.3.518.314","volume":"27","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. Oper. Res.\u00a027(3), 518\u2013544 (2002)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.comnet.2003.12.017","volume":"45","author":"A. Bar-Noy","year":"2004","unstructured":"Bar-Noy, A., Dreizin, V., Patt-Shamir, B.: Efficient algorithms for periodic scheduling. Computer Networks\u00a045(2), 155\u2013173 (2004)","journal-title":"Computer Networks"},{"key":"7_CR5","unstructured":"Cohen, E., Fiat, A., Kaplan, H.: Efficient sequences of trials. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (2003)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, E., Hassidim, A., Kaplan, H., Mansour, Y., Raz, D., Tzur, Y.: Probe scheduling for efficient detection of silent failures. Technical Report cs.NI\/1302.0792, arXiv (2013)","DOI":"10.1016\/j.peva.2014.07.005"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proceedings of the ACM SIGCOMM 2002 Conference (2002)","DOI":"10.1145\/633025.633043"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. Assoc. Comput. Mach.\u00a045, 634\u2013652 (1998)","journal-title":"J. Assoc. Comput. Mach."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-45753-4_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"U. Feige","year":"2002","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating min-sum set cover. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 94\u2013107. Springer, Heidelberg (2002)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Hameed, S., Vaidya, N.H.: Log-time algorithms for scheduling single and multiple channel data broadcast. In: Proc. of ACM\/IEEE MobiCom (1997)","DOI":"10.1145\/262116.262136"},{"key":"7_CR11","volume-title":"Queueing Systems. Computer Applications","author":"L. Kleinrock","year":"1976","unstructured":"Kleinrock, L.: Queueing Systems. Computer Applications, vol.\u00a0II. Wiley-Interscience, New York (1976)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen, H.X., Teixeira, R., Thiran, P., Diot, C.: Minimizing probing cost for detecting interface failures: Algorithms and scalability analysis. In: INFOCOM (2009)","DOI":"10.1109\/INFCOM.2009.5062054"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Zeng, H., Kazemian, P., Varghese, G., McKeon, N.: Automatic test packet generation. In: CONEXT (2012)","DOI":"10.1145\/2413176.2413205"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/TC.2011.244","volume":"62","author":"Q. Zheng","year":"2013","unstructured":"Zheng, Q., Cao, G.: Minimizing probing cost and achieving identifiability in probe based network link monitoring. IEEE Tran. Computers\u00a062(3), 510\u2013523 (2013)","journal-title":"IEEE Tran. Computers"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T00:17:36Z","timestamp":1646353056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}