{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:47:48Z","timestamp":1648702068814},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,4,2]],"date-time":"2015-04-02T00:00:00Z","timestamp":1427932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10601-015-9188-8","type":"journal-article","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T17:56:41Z","timestamp":1427911001000},"page":"433-451","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A constraint programming approach to the additional relay placement problem in wireless sensor networks"],"prefix":"10.1007","volume":"20","author":[{"given":"Luis","family":"Quesada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lanny","family":"Sitanayah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth N.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cormac J.","family":"Sreenan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,2]]},"reference":[{"issue":"4","key":"9188_CR1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10601-007-9040-x","volume":"13","author":"N Beldiceanu","year":"2008","unstructured":"Beldiceanu, N., Flener, P., & Lorca, X. (2008). Combining tree partitioning, precedence, and incomparability constraints. Constraints, 13(4), 459\u2013489.","journal-title":"Constraints"},{"issue":"4","key":"9188_CR2","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/j.jpdc.2005.12.007","volume":"66","author":"A Boukerche","year":"2006","unstructured":"Boukerche, A., Pazzi, R.W.N., & Araujo, R.B. (2006). fault-tolerant wireless sensor network routing protocols for the supervision of contex-aware physical environments. Journal of Parallel and Distributed Computing, 66(4), 586\u2013599.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9188_CR3","doi-asserted-by":"crossref","unstructured":"Bredin, J.L., Demaine, E.D., Hajiaghayi, M., & Rus, D. (2005). Deploying sensor networks with guaranteed capacity and fault tolerance. In: Proc. 6th ACM Int\u2019l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc\u201905).","DOI":"10.1145\/1062689.1062729"},{"key":"9188_CR4","doi-asserted-by":"crossref","unstructured":"Chipara, O., He, Z., Xing, G., Chen, Q., Wang, X., Lu, C., Stankovic, J., & Abdelzaher, T. (2006). Real-time power-aware routing in wireless sensor networks. In: Proc. 14th IEEE Workshop Quality of Service (IWQoS\u201906).","DOI":"10.1109\/IWQOS.2006.250454"},{"key":"9188_CR5","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., & Leiserson, C.E. (2001). Introduction to algorithms, 2nd edn. McGraw-Hill higher education."},{"key":"9188_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., & Resende, M.G.C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"9188_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., & Resende, M.G.C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"9188_CR8","doi-asserted-by":"crossref","unstructured":"Gnawali, O., Fonseca, R., Jamieson, K., Moss, D., & Levis, P. (2009). Collection tree protocol. In: Proc. 7th ACM Conf. Embedded Networked Sensor Systems (SenSys\u201909).","DOI":"10.1145\/1644038.1644040"},{"issue":"1","key":"9188_CR9","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.disopt.2010.09.009","volume":"8","author":"PA Golovach","year":"2011","unstructured":"Golovach, P.A., & Thilikos, D.M. (2011). Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discrete Optimization, 8(1), 72\u201386.","journal-title":"Discrete Optimization"},{"issue":"5","key":"9188_CR10","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TMC.2009.161","volume":"9","author":"X Han","year":"2010","unstructured":"Han, X., Cao, X., Lloyd, E.L., & Shen, C.C. (2010). Fault-tolerant relay node placement in heterogeneous wireless sensor networks. IEEE Transactions on Mobile Computing, 9(5), 643\u2013656.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"9188_CR11","unstructured":"Junker, U. (2004). QUICKXPLAIN: Preferred explanations and relaxations for over-constrained problems. In: McGuinness, D.L., Ferguson, G. (eds) AAAI, AAAI Press\/The MIT Press."},{"issue":"4","key":"9188_CR12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02019432","volume":"9","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L., Neumann-Lara, V., & Plummer, M. (1978). Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica, 9(4), 269\u2013276.","journal-title":"Periodica Mathematica Hungarica"},{"key":"9188_CR13","doi-asserted-by":"crossref","unstructured":"Misra, S., Hong, S.D., Xue, G., & Tang, J. (2008). Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements. In: Proc. 27th Ann. IEEE Conf. Computer Communications (INFOCOM\u201908).","DOI":"10.1109\/INFOCOM.2008.65"},{"issue":"7","key":"9188_CR14","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1002\/wcm.638","volume":"9","author":"J Pu","year":"2008","unstructured":"Pu, J., Xiong, Z., & Lu, X. (2008). Fault-tolerant deployment with k-connectivity and partial k-connectivity in sensor networks. Wireless Communications and Mobile Computing, 9(7), 909\u2013919.","journal-title":"Wireless Communications and Mobile Computing"},{"key":"9188_CR15","unstructured":"Resende, M.G.C., & Ribeiro, C.C. (2002). Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds) State of the Art Handbook in Metaheuristics, Kluwer Academic Publishers."},{"key":"9188_CR16","doi-asserted-by":"crossref","unstructured":"Sitanayah, L., Brown, K.N., & Sreenan, C.J. (2011). Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks. In: Proc. 4th Int\u2019l Conf. IFIP Wireless Days (WD\u201911), IEEE.","DOI":"10.1109\/WD.2011.6098176"},{"issue":"5","key":"9188_CR17","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1109\/TCSI.2006.869907","volume":"53","author":"Y Xiao","year":"2006","unstructured":"Xiao, Y., Thulasiraman, K., & Xue, G. (2006). Constrained shortest link-disjoint paths selection: A network programming based approach. IEEE Trans Circuits and Systems I: Regular Papers, 53(5), 1174\u20131187. doi: 10.1109\/TCSI.2006.869907 .","journal-title":"IEEE Trans Circuits and Systems I: Regular Papers"},{"issue":"3","key":"9188_CR18","doi-asserted-by":"crossref","first-page":"2899","DOI":"10.3390\/s110302899","volume":"11","author":"Y Zeng","year":"2011","unstructured":"Zeng, Y., Sreenan, C.J., Sitanayah, L., Xiong, N., Park, J.H., & Zheng, G. (2011). An emergency-adaptive routing scheme for wireless sensor networks for building fire hazard monitoring. Sensors, 11(3), 2899\u20132919.","journal-title":"Sensors"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9188-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9188-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9188-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:18Z","timestamp":1559243658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9188-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,2]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9188"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9188-8","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,2]]}}}