{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:21:09Z","timestamp":1778606469467,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2014,3,2]],"date-time":"2014-03-02T00:00:00Z","timestamp":1393718400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s11590-014-0731-0","type":"journal-article","created":{"date-parts":[[2014,3,3]],"date-time":"2014-03-03T17:55:00Z","timestamp":1393869300000},"page":"2245-2259","source":"Crossref","is-referenced-by-count":6,"title":["Computational complexity analysis of the sensor location flow observability problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Monica","family":"Gentili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pitu","family":"Mirchandani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,2]]},"reference":[{"key":"731_CR1","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1287\/trsc.35.1.50.10140","volume":"35","author":"L Bianco","year":"2001","unstructured":"Bianco, L., Confessore, G., Reverberi, P.: A network based model for traffic sensor location with implication in o-d matrix estimates. Transp. Sci. 35, 50\u201360 (2001)","journal-title":"Transp. Sci."},{"key":"731_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10479-006-0016-9","volume":"144","author":"L Bianco","year":"2006","unstructured":"Bianco, L., Confessore, G., Gentili, M.: Combinatorial aspects of the sensor location problem. Ann. Oper. Res. 144, 201\u2013234 (2006)","journal-title":"Ann. Oper. Res."},{"key":"731_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H Broersma","year":"1997","unstructured":"Broersma, H., Li, X.: Spanning trees with many or few colors in edge colored graphs. Discuss. Math. Graph Theory 17, 259\u2013269 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"731_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(02)00241-9","volume":"31","author":"T Br\u00fcggemann","year":"2003","unstructured":"Br\u00fcggemann, T., Monnot, J., Woeginger, G.J.: Local search for the minimum label spanning tree problem with bounded color classes. Oper. Res. Lett. 31, 195\u2013201 (2003)","journal-title":"Oper. Res. Lett."},{"key":"731_CR5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.trb.2007.09.004","volume":"42","author":"E Castillo","year":"2008","unstructured":"Castillo, E., Men\u00e9ndez, J.M., Jim\u00e9nez, P.: Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations. Transp. Res. Part B 42, 455\u2013481 (2008)","journal-title":"Transp. Res. Part B"},{"issue":"2","key":"731_CR6","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/TITS.2010.2042958","volume":"11","author":"E Castillo","year":"2010","unstructured":"Castillo, E., Gallego, I., Menndez, J.M., Rivas, A.: Optimal use of plate scanning resources for route flow estimation in traffic networks. IEEE Trans. Intell. Transp. Syst. 11(2), 380\u2013391 (2010)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"731_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00127-0","volume":"63","author":"R-S Chang","year":"1997","unstructured":"Chang, R.-S., Leu, S.-J.: The minimum labeling spanning trees. Inf. Process. Lett. 63, 277\u2013282 (1997)","journal-title":"Inf. Process. Lett."},{"key":"731_CR8","unstructured":"Cockayne, E., Goodman, S., Hedetniemi, S.: A linear algorithm for the domination number of a tree. Inf. Process. Lett. 4(2), 41\u201344 (1975)"},{"key":"731_CR9","doi-asserted-by":"crossref","first-page":"2383","DOI":"10.1016\/j.cor.2004.03.008","volume":"32","author":"G Confessore","year":"2005","unstructured":"Confessore, G., Dell\u2019Olmo, P., Gentili, M.: Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem. Comput. Oper. Res. 32, 2383\u20132405 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"731_CR10","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.12.2.193","volume":"12","author":"M Conforti","year":"1987","unstructured":"Conforti, M., Rao, M.R.: Some new matroids on graphs: cut sets and the max cut problem. Math. Oper. Res. 12(2), 193\u2013204 (1987)","journal-title":"Math. Oper. Res."},{"key":"731_CR11","first-page":"1","volume":"64","author":"L Fleischer","year":"2000","unstructured":"Fleischer, L.: Recent progress in submodular function minimization. Optima 64, 1\u201311 (2000)","journal-title":"Optima"},{"key":"731_CR12","unstructured":"Gentili, M.: New models and algorithms for the location of sensors on traffic networks. PhD dissertation. Department of Statistics Probability and Applied Statistics, University of Rome La Sapienza (2002)"},{"key":"731_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-2047-z","volume":"136","author":"M Gentili","year":"2005","unstructured":"Gentili, M., Mirchandani, P.B.: Location of active sensors on traffic network. Ann. Oper. Res. 136, 229\u2013257 (2005)","journal-title":"Ann. Oper. Res."},{"key":"731_CR14","doi-asserted-by":"crossref","first-page":"108","DOI":"10.3141\/2243-13","volume":"2243","author":"M Gentili","year":"2011","unstructured":"Gentili, M., Mirchandani, P.: Survey of models to locate sensors to estimate traffic flows. Transp. Res. Rec J Transp Res Board 2243, 108\u2013116 (2011)","journal-title":"Transp. Res. Rec J Transp Res Board"},{"key":"731_CR15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.trc.2012.01.004","volume":"24","author":"M Gentili","year":"2012","unstructured":"Gentili, M., Mirchandani, P.B.: Locating sensors on traffic networks: models, challenges and research opportunities. Transp. Res. Part C Emerg. Technolog. 24, 227\u2013255 (2012)","journal-title":"Transp. Res. Part C Emerg. Technolog."},{"issue":"4","key":"731_CR16","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF01192523","volume":"15","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Ramakrishnan, V.S.: Minimizing submodular set functions over families of sets. Combinatorica 15(4), 499\u2013513 (1995)","journal-title":"Combinatorica"},{"key":"731_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, New York (1988)"},{"key":"731_CR18","unstructured":"Hedetniemi, S.T., Laskar, R.C.: Topics on domination. Annals of discrete mathematics, 48. Sole distributors for the USA and Canada, Elsevier Science, New York (1991)"},{"key":"731_CR19","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.trb.2009.02.008","volume":"43","author":"S Hu","year":"2009","unstructured":"Hu, S., Peeta, S., Chu, C.: Identification of vehicle sensor locations for link-based network. Transp. Res. Part B 43, 873\u2013894 (2009)","journal-title":"Transp. Res. Part B"},{"key":"731_CR20","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"731_CR21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fischer, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"731_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0731-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0731-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0731-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:38Z","timestamp":1559394698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0731-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,2]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["731"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0731-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,2]]}}}