{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:43:55Z","timestamp":1648629835852},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"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":["Telecommun Syst"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s11235-016-0151-9","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T12:30:46Z","timestamp":1457699446000},"page":"719-725","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An $$O(mn \\log U)$$ O ( m n log U ) time algorithm for estimating the maximum cost of adjusting an infeasible network"],"prefix":"10.1007","volume":"63","author":[{"given":"Mehdi","family":"Ghiyasvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,11]]},"reference":[{"key":"151_CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"151_CR2","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/TC.2011.145","volume":"61","author":"C Busch","year":"2012","unstructured":"Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating ongestion + ilation in networks via quality of routing games. IEEE Transactions on Computers, 61, 1270\u20131283.","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"151_CR3","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.adhoc.2011.02.004","volume":"10","author":"H Cheng","year":"2012","unstructured":"Cheng, H., Xiongb, N., Vasilakos, A. V., Yangd, L. T., Chena, G., & Zhuanga, X. (2012). Nodes organization for channel assignment withtopology preservation in multi-radio wireless mesh networks. Ad Hoc Networks, 10(5), 760\u2013773.","journal-title":"Ad Hoc Networks"},{"key":"151_CR4","doi-asserted-by":"crossref","unstructured":"Chilamkurti, N., Zeadally, S., Vasilakos, A., & Sharma, V. (2009). Cross-layer support for energy efficient routing in wireless sensor networks. Journal of Sensors, 1, 1\u20139.","DOI":"10.1155\/2009\/134165"},{"issue":"2","key":"151_CR5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.amc.2007.03.038","volume":"192","author":"H Salehi Fathabadi","year":"2007","unstructured":"Salehi Fathabadi, H., & Ghiyasvand, M. (2007). A new algorithm for solving the feasibility problem of a network flow. Applied Mathematics and Computation, 192(2), 429\u2013438.","journal-title":"Applied Mathematics and Computation"},{"key":"151_CR6","doi-asserted-by":"crossref","first-page":"5276","DOI":"10.1016\/j.apm.2011.04.027","volume":"35","author":"M Ghiyasvand","year":"2011","unstructured":"Ghiyasvand, M. (2011). An $$O(mn \\log (nU))$$ O ( m n log ( n U ) ) time algorithm to solve the feasibility problem. Applied Mathematical Modelling, 35, 5276\u20135285.","journal-title":"Applied Mathematical Modelling"},{"key":"151_CR7","unstructured":"Ghiyasvand, M. (2016). Adjusting an infeasible network by minimizing the sum of the violation costs. Scientia Iranica (accepted)."},{"issue":"1","key":"151_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.amc.2005.09.058","volume":"176","author":"M Ghiyasvand","year":"2006","unstructured":"Ghiyasvand, M. (2006). A new approach for computing a most positive cut using the minimum flow algorithms. Applied Mathematics and Computation, 176(1), 27\u201336.","journal-title":"Applied Mathematics and Computation"},{"issue":"12","key":"151_CR9","doi-asserted-by":"crossref","first-page":"2538","DOI":"10.1109\/JPROC.2013.2257631","volume":"101","author":"M Li","year":"2013","unstructured":"Li, M., Li, Z., & Vasilakos, A. V. (2013). A survey on topology control in wireless sensor networks: taxonomy, comparative study, and open issues. Proceedings of the IEEE, 101(12), 2538\u20132557.","journal-title":"Proceedings of the IEEE"},{"key":"151_CR10","unstructured":"Li, P., Guo, S., Yu, S., & Vasilakos, A. V. (2012). An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In Proceedings of the IEEE INFOCOM 2012 (pp. 100\u2013108)."},{"key":"151_CR11","doi-asserted-by":"crossref","unstructured":"Hoffman, A. J. (1960). Some recent applications of the theory of linear inequalities to extremal combinatorial analysis. In Combinatorial Analysis, Proceedings of Symposia in Applied Mathematics (Vol. X, pp. 113\u2013127).","DOI":"10.1090\/psapm\/010\/0114759"},{"key":"151_CR12","first-page":"179","volume":"78","author":"ST McCormick","year":"1997","unstructured":"McCormick, S. T. (1997). How to compute least infeasible flows. Mathematical Programming, 78, 179\u2013194.","journal-title":"Mathematical Programming"},{"key":"151_CR13","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TC.2015.2417543","volume":"65","author":"T Meng","year":"2016","unstructured":"Meng, T., Wu, F., Yang, Z., Chen, G., & Vasilakos, A. V. (2016). Spatial reusability-aware routing in multi-hop wireless networks. IEEE Transactions on Computers, 65, 244\u2013255.","journal-title":"IEEE Transactions on Computers"},{"key":"151_CR14","doi-asserted-by":"crossref","unstructured":"Orlin, J. B. (2013). Max Flows in O(nm) time, or better. Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 765\u2013774). New York.","DOI":"10.1145\/2488608.2488705"},{"key":"151_CR15","doi-asserted-by":"crossref","unstructured":"Quan, W., Xu, C., Vasilakos, A. V., Guan, J., Zhang, H., & Grieco, L. A. (2014). Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking. Networking Conference, 2014 IFIP (pp. 1\u20139). IEEE.","DOI":"10.1109\/IFIPNetworking.2014.6857122"},{"issue":"8","key":"151_CR16","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1007\/s11276-010-0276-9","volume":"16","author":"T Spyropoulos","year":"2010","unstructured":"Spyropoulos, T., Rais, R. N. B., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349\u20132370.","journal-title":"Wireless Networks"},{"issue":"3","key":"151_CR17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/TSMCC.2003.817354","volume":"33","author":"AV Vasilakos","year":"2003","unstructured":"Vasilakos, A. V., Saltouros, M. P., Atlassis, A. F., & Pedrycz, W. (2003). Optimizing qos routing in hierarchical ATM networks using computational intelligence techniques. IEEE Transactions on Systems, Man, and Cybernetics, 33(3), 297\u2013312.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"151_CR18","volume-title":"Delay tolerant networks: Protocols and applications","author":"AV Vasilakos","year":"2012","unstructured":"Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2012). Delay tolerant networks: Protocols and applications. Boca Rotan: CRC press."},{"issue":"1","key":"151_CR19","first-page":"4","volume":"17","author":"X Wang","year":"2012","unstructured":"Wang, X., Vasilakos, A. V., Chen, M., Liu, Y., & Kwon, T. T. (2012). A survey of green mobile networks: Opportunities and challenges. MONET, 17(1), 4\u201320.","journal-title":"MONET"},{"key":"151_CR20","doi-asserted-by":"crossref","unstructured":"Xiang, L., Luo, J., & Vasilakos, A. V. (2011). Compressed data aggregation for energy efficient wireless sensor networks. In Global Telecommunications Conference (GLOBECOM 2011) (pp. 1\u20135). IEEE.","DOI":"10.1109\/SAHCN.2011.5984932"},{"key":"151_CR21","doi-asserted-by":"crossref","unstructured":"Yao, Y., Cao, Q., & Vasilakos, A. V. (2013). An energy-efficient, delay-aware, and lifetime-balancing data collection protocol for wireless sensor networks. In IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems (pp. 182\u2013190). IEEE.","DOI":"10.1109\/MASS.2013.44"},{"key":"151_CR22","doi-asserted-by":"crossref","unstructured":"Yen, Y. S., Chao, H. C., Chang, R. S., & Vasilakos, A. V. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53, 2238\u20132250.","DOI":"10.1016\/j.mcm.2010.10.008"},{"issue":"1","key":"151_CR23","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"Youssef, M., Ibrahim, M., Abdelatif, M., Che, L., & Vasilakos, A. V. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys and Tutorials, 16(1), 92\u2013109.","journal-title":"IEEE Communications Surveys and Tutorials"},{"issue":"2","key":"151_CR24","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11276-012-0457-9","volume":"19","author":"Y Zeng","year":"2013","unstructured":"Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161\u2013173.","journal-title":"Wireless Networks"},{"issue":"1","key":"151_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s11235-013-9718-x","volume":"54","author":"B Zhang","year":"2013","unstructured":"Zhang, B., Wang, Y., Vasilakos, A. V., & Ma, J. (2013). Mobile social networking: Reconnect virtual community with physical space. Telecommunication Systems, 54(1), 91\u2013110.","journal-title":"Telecommunication Systems"},{"issue":"7","key":"151_CR26","doi-asserted-by":"crossref","first-page":"1358","DOI":"10.1109\/JSAC.2011.110803","volume":"29","author":"L Zhou","year":"2011","unstructured":"Zhou, L., Chao, H. C., & Vasilakos, A. V. (2011). Joint forensics-scheduling strategy for delay-sensitive multimedia applications over heterogeneous networks. IEEE Journal on Selected Areas in Communications, 29(7), 1358\u20131367.","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0151-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-016-0151-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0151-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0151-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T06:50:22Z","timestamp":1559371822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-016-0151-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,11]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["151"],"URL":"https:\/\/doi.org\/10.1007\/s11235-016-0151-9","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,11]]}}}