{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:07Z","timestamp":1759638307481,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_8","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"93-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fixed-Parameter Tractable Algorithms for Tracking Set Problems"],"prefix":"10.1007","author":[{"given":"Aritra","family":"Banik","sequence":"first","affiliation":[]},{"given":"Pratibha","family":"Choudhary","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-57586-5_7","volume-title":"Algorithms and Complexity","author":"A Banik","year":"2017","unstructured":"Banik, A., Katz, M.J., Packer, E., Simakov, M.: Tracking paths. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 67\u201379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_7"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bhatti, S., Xu, J.: Survey of target tracking protocols using wireless sensor network. In: Proceedings of the 2009 Fifth International Conference on Wireless and Mobile Communications, ICWMC 2009, Washington, D.C., pp. 110\u2013115. IEEE Computer Society (2009)","DOI":"10.1109\/ICWMC.2009.25"},{"issue":"1\u20133","key":"8_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"KMJ De Bontridder","year":"2003","unstructured":"De Bontridder, K.M.J., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program. 98(1\u20133), 477\u2013491 (2003)","journal-title":"Math. Program."},{"key":"8_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s00453-014-9948-7","volume":"74","author":"R Crowston","year":"2016","unstructured":"Crowston, R., Gutin, G., Jones, M., Muciaccia, G., Yeo, A.: Parameterizations of test cover with bounded test sizes. Algorithmica 74(1), 367\u2013384 (2016)","journal-title":"Algorithmica"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-32589-2_27","volume-title":"Mathematical Foundations of Computer Science 2012","author":"R Crowston","year":"2012","unstructured":"Crowston, R., Gutin, G., Jones, M., Saurabh, S., Yeo, A.: Parameterized study of the test cover problem. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 283\u2013295. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_27"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, 1st edn. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","edition":"1"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45749-6_23","volume-title":"Algorithms \u2014 ESA 2002","author":"KMJ De Bontridder","year":"2002","unstructured":"De Bontridder, K.M.J., Lageweg, B.J., Lenstra, J.K., Orlin, J.B., Stougie, L.: Branch-and-bound algorithms for the test cover problem. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 223\u2013233. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_23"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/1149283.1149284","volume":"2","author":"D Ganesan","year":"2006","unstructured":"Ganesan, D., Cristescu, R., Beferull-Lozano, B.: Power-efficient sensor placement and transmission structure for data gathering under distortion constraints. ACM Trans. Sens. Netw. 2(2), 155\u2013181 (2006)","journal-title":"ACM Trans. Sens. Netw."},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ipl.2012.12.008","volume":"113","author":"G Gutin","year":"2013","unstructured":"Gutin, G., Muciaccia, G., Yeo, A.: (Non-)existence of polynomial kernels for the test cover problem. Inf. Process. Lett. 113(4), 123\u2013126 (2013)","journal-title":"Inf. Process. Lett."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-44676-1_13","volume-title":"Algorithms \u2014 ESA 2001","author":"BV Halld\u00f3rsson","year":"2001","unstructured":"Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Ravi, R.: On the approximability of the minimum test collection problem. In: auf der Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 158\u2013169. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44676-1_13"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335\u2013354 (1999)","journal-title":"J. Algorithms"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137\u2013153 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1137\/0906067","volume":"6","author":"BME Moret","year":"1985","unstructured":"Moret, B.M.E., Shapiro, H.D.: On minimizing a set of tests. SIAM J. Sci. Stat. Comput. 6(4), 983\u20131003 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:50:52Z","timestamp":1709826652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}