{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:28:36Z","timestamp":1742916516612,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266886"},{"type":"electronic","value":"9783319266909"}],"license":[{"start":{"date-parts":[[2015,11,10]],"date-time":"2015-11-10T00:00:00Z","timestamp":1447113600000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-26690-9_39","type":"book-chapter","created":{"date-parts":[[2015,11,9]],"date-time":"2015-11-09T00:25:43Z","timestamp":1447028743000},"page":"437-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Genetic Algorithms for the Tree T-Spanner Problem"],"prefix":"10.1007","author":[{"given":"Riham","family":"Moharam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehab","family":"Morsy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ismail A.","family":"Ismail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,10]]},"reference":[{"issue":"4","key":"39_CR1","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"David Peleg","year":"1989","unstructured":"Peleg, D., Ulman, J.D.: An optimal sychronizer for the hypercube. SIAM J. Comput. 740\u2013747 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"39_CR2","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1137\/060666202","volume":"38","author":"Yuval Emek","year":"2009","unstructured":"Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. SIAM J. Comput. 1761\u20131781 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Demmer, M.J., Herlihy, M.P.: The arrow distributed directory protocol. In: Proceeding of the 12th International Symposium on Distributed Computing (DISC), pp. 119\u2013133. Springer (1998)","DOI":"10.1007\/BFb0056478"},{"issue":"3","key":"39_CR4","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1006\/jcss.2001.1787","volume":"63","author":"David Peleg","year":"2001","unstructured":"Peleg, D., Reshef, E.: Low complexity variants of the arrow distributed directory. J. Comput.. Syst. Sci, pp. 474\u2013485 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. Theory Comput. Syst. pp. 875\u2013901 (2006)","DOI":"10.1007\/s00224-006-1251-9"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Tirthapura, S., Wattenhofer, R.: Competitive concurrent distributed queuing. In: Proceedings of the 20th Annual ACM Symposium on Princibles of Distributed Computing, pp. 127\u2013133 (2001)","DOI":"10.1145\/383962.384001"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Cai. L., Corneil, D., Tree Spanners. SIAM J. Discret. Math. 359\u2013387 (1995)","DOI":"10.1137\/S0895480192237403"},{"issue":"1-3","key":"39_CR8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0304-3975(03)00424-9","volume":"310","author":"Andreas Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, H.-O., Le, V.B.: Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 329\u2013354 (2004)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"39_CR9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00453-006-1209-y","volume":"47","author":"Andreas Brandstadt","year":"2006","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, H.-O., Le, V.B., Uehara, R.: Tree spanners for bipartite graphs and probe interval graphs. Algorithmica 27\u201351 (2007)","journal-title":"Algorithmica"},{"key":"39_CR10","unstructured":"Peleg, D., Tendler, D.: Low stretch spanning trees for planar graphs, Technical Report. MCS01-14, Weizmann Science Press of Israel (2001)"},{"issue":"1-2","key":"39_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0166-218X(00)00226-2","volume":"108","author":"S\u00e1ndor P. Fekete","year":"2001","unstructured":"Fekete, S.P., Kremer, J.: Tree spanners in planar graphs, Discret. Appl. Math, pp. 85\u2013103 (2001)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"39_CR12","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1016\/j.jcss.2010.10.002","volume":"77","author":"Feodor F. Dragan","year":"2011","unstructured":"Dragan, F.F., Fomin, F.V., Golovach, P.A.: Spanners in sparse graphs. J. Comput. Syst. Sci. pp. 1108\u20131119 (2010)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"39_CR13","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1007\/s00453-013-9765-4","volume":"69","author":"Feodor F. Dragan","year":"2013","unstructured":"Dragan, F.F., K\u00f6hler, E.: An approximation algorithm for the tree t-spanner problem on unweighted graphs via generlized chordal graphs. Algorithmica 884\u2013905 (2014)","journal-title":"Algorithmica"},{"key":"39_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9780470512517","volume-title":"Computational Intelligence: An Introduction","author":"AP Engelbrecht","year":"2007","unstructured":"Engelbrecht, A.P.: Computational Intelligence: An Introduction. Wiley, New York (2007)"},{"key":"39_CR15","unstructured":"Abdoun, O., Abouchabaka, J., Tajani, C.: Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem, CoRR abs\/1203.3099 (2012)"},{"key":"39_CR16","unstructured":"Hesser, J., Manner, R.: Towards an optimal mutation probability for genetic algorithms. In: Proceedings of 1st Workshop in Parallel Problem Solving From Nature, pp. 2332 (1991)"},{"key":"39_CR17","unstructured":"LIN, W-Y., LEE, W-Y., Hong, T-P.: Adapting crossover and mutation rates in genetic algorithms. In: The Sixth Conference on Artificial Intelligence and Applications, Kaohsiung, Taiwan (2001)"},{"key":"39_CR18","unstructured":"Roeva, O., Fidanova, S., Paprzycki, M.: Influence of the population size on the genetic algorithm performance in case of cultivation process modelling. In: Proceedings of the Federated Conference on Computer Science and Information Systems, pp. 371\u2013376 (2013)"},{"key":"39_CR19","first-page":"438","volume-title":"Lecture Notes in Computer Science","author":"Kanta Vekaria","year":"1998","unstructured":"Vekaria, K., Clack, C.: Selective crossover in genetic algorithms: an empirical study.Lecture Notes in Computer Science, vol. 1498, pp. 438\u2013447 (1998)"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Chipperfield, A., Fleming, P., Pohlheim, H., Fonseca, C.: The Matlab Genetic Algorithm User\u2019s Guide, UK SERC (1994)","DOI":"10.1049\/ic:19950061"},{"key":"39_CR21","unstructured":"Blickle, T., Thiele, L.: A Comparison of Selection Schemes used in Genetic Algorithms, Zurich (1995)"},{"key":"39_CR22","unstructured":"Erdos, P., Renyi, A.: On random graphs. Publ. Math. 290 (1959)"},{"key":"39_CR23","first-page":"797","volume-title":"Construction of Minimum-Weight Spanners","author":"M Sigurd","year":"2004","unstructured":"Sigurd, M., Zachariasen, M.: Construction of Minimum-Weight Spanners, pp. 797\u2013808. Springer, Berlin (2004)"},{"issue":"2","key":"39_CR24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0166-218X(03)00259-2","volume":"137","author":"Arthur M. Farley","year":"2004","unstructured":"Farley, A.M., Zappala, D., Proskurowski, A., Windisch, K.: Spanners and message distribution in networks. Dicret. Appl. Math. 159\u2013171 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"39_CR25","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1137\/S0097539700382947","volume":"31","author":"Joachim Gudmundsson","year":"2002","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Fast greedy algorithms for constructing sparse geometric spanners. SIAM J. Comput. pp. 1479\u20131500 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"39_CR26","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-45735-6_26","volume-title":"String Processing and Information Retrieval","author":"Gonzalo Navarro","year":"2002","unstructured":"Navarro, G., Paredes, R., Chavez, E.: t-Spanners as a data structure for metric space searching. In: International Symposium on String Processing and Information Retrieval, SPIRE, LNCS 2476, pp. 298\u2013309 (2002)"}],"container-title":["Advances in Intelligent Systems and Computing","The 1st International Conference on Advanced Intelligent System and Informatics (AISI2015), November 28-30, 2015, Beni Suef, Egypt"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26690-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:08:28Z","timestamp":1559293708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26690-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,10]]},"ISBN":["9783319266886","9783319266909"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26690-9_39","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,11,10]]},"assertion":[{"value":"10 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}