{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:42:11Z","timestamp":1648665731142},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,12]],"date-time":"2013-02-12T00:00:00Z","timestamp":1360627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Informatik Spektrum"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s00287-013-0680-5","type":"journal-article","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T03:49:50Z","timestamp":1360554590000},"page":"180-186","source":"Crossref","is-referenced-by-count":0,"title":["Deutsch-indische Kooperation im Algorithm Engineering"],"prefix":"10.1007","volume":"36","author":[{"given":"Lasse","family":"Kliemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,12]]},"reference":[{"key":"680_CR1","doi-asserted-by":"crossref","unstructured":"Alon N, Matias Y, Szegedy M (1999) The space complexity of approximating the frequency moments. J Comput Syst Sci 58:137\u2013147. Conference version at STOC 1996.","DOI":"10.1006\/jcss.1997.1545"},{"key":"680_CR2","unstructured":"Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Tech. rep., Carnegie Mellon University, Pittsburgh, PA"},{"key":"680_CR3","doi-asserted-by":"crossref","unstructured":"Bansal N (2010) Constructive algorithms for discrepancy minimization. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, Nevada, USA, October 2010 (FOCS 2010), 3\u201310","DOI":"10.1109\/FOCS.2010.7"},{"key":"680_CR4","doi-asserted-by":"crossref","unstructured":"Bhuvanagiri L, Ganguly S, Kesh D, Saha C (2006) Simpler algorithm for estimating frequency moments of data streams. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, Florida, USA, January 2006 (SODA 2006), 708\u2013713","DOI":"10.1145\/1109557.1109634"},{"key":"680_CR5","doi-asserted-by":"crossref","unstructured":"Delling D, Sanders P, Schultes D, Wagner D (2009) Engineering route planning algorithms. In: Algorithmics of Large and Complex Networks, Lecture Notes in Computer Science, vol 5515, 117\u2013139","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"680_CR6","doi-asserted-by":"crossref","unstructured":"Doerr B, Hota AR, K\u00f6tzing T (2012) Ants easily solve stochastic shortest path problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, Philadelphia, USA, July 2012 (GECCO 2012), 17\u201324","DOI":"10.1145\/2330163.2330167"},{"key":"680_CR7","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/s00453-011-9556-8","volume":"63","author":"S Eggert","year":"2012","unstructured":"Eggert S, Kliemann L, Munstermann P, Srivastav A (2012) Bipartite matching in the semi-streaming model. Algorithmica 63:490\u2013508, doi: 10.1007\/s00453-011-9556-8. Document ID: 519a88bb-5f5a-409d-8293-13cd80a66b36. Published online August 2011. Conference version in proceedings of ESA 2009","journal-title":"Algorithmica"},{"key":"680_CR8","doi-asserted-by":"crossref","unstructured":"Goerigk M, Sch\u00f6bel A (2011) A scenario-based approach for robust linear optimization. In: Proceedings of the 1st International ICST Conference on Practice and Theory of Algorithms in (Computer) Systems, Rome, Italy, April 2012 (TAPAS 2012), 139\u2013150","DOI":"10.1007\/978-3-642-19754-3_15"},{"issue":"6","key":"680_CR9","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","volume":"6","author":"KH Han","year":"2002","unstructured":"Han KH, Kim JH (2002) Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. IEEE Trans Evol Comput 6(6):580\u2013593, doi: 10.1109\/TEVC.2002.804320","journal-title":"IEEE Trans Evol Comput"},{"key":"680_CR10","unstructured":"Harik GR, Lobo FG, Goldberg DE (1997) The compact genetic algorithm. Tech. rep., University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL"},{"key":"680_CR11","doi-asserted-by":"crossref","unstructured":"Kliemann L (2011) Matching in bipartite graph streams in a small number of passes (extended abstract). In: Proceedings of the 10th International Symposium on Experimental and Efficient Algorithms, Kolimpari, Chania, Crete, Greece, May 2011 (SEA 2011), 254\u2013266, doi: 10.1007\/978-3-642-20662-7_22. Document ID: dda51148-ac5b-4655-9c4f-e01f26511235","DOI":"10.1007\/978-3-642-20662-7_22"},{"key":"680_CR12","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/j.cor.2009.03.022","volume":"37","author":"C Liebchen","year":"2010","unstructured":"Liebchen C, Schachtebeck M, Sch\u00f6bel A, Stiller S, Prigge A (2010) Computing delay resistant railway timetables. Comput Operat Res 37:857\u2013868","journal-title":"Comput Operat Res"},{"key":"680_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/HIS-2010-0115","volume":"7","author":"A Mani","year":"2010","unstructured":"Mani A, Patvardhan C (2010) A hybrid quantum evolutionary algorithm for solving engineering optimization problems. Int J Hybrid Intel Syst 7:225\u2013235","journal-title":"Int J Hybrid Intel Syst"},{"key":"680_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1090\/S0894-0347-96-00175-0","volume":"9","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek J, Spencer J (1996) Discrepancy in arithmetic progressions. J Am Math Soc 9:195\u2013204, http:\/\/www.jstor.org\/stable\/2152845, last access 5.2.2013","journal-title":"J Am Math Soc"},{"key":"680_CR15","unstructured":"Muralidhara VN, Sen S (2010) The covert set cover problem with application to network discovery. In: Proceedings of the 4th International Workshop on Algorithms and Computation, Dhaka, Bangladesh, India, February 2010 (WALCOM 2010), 228\u2013239"},{"issue":"4","key":"680_CR16","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10951-008-0056-x","volume":"11","author":"V Nagarajan","year":"2008","unstructured":"Nagarajan V, Ranade A (2008) Exact train pathing. J Schedul 11(4):279\u2013297","journal-title":"J Schedul"},{"key":"680_CR17","unstructured":"Patvardhan C, Prakash P, Srivastav A (2009) A novel quantum-inspired evolutionary algorithm for the quadratic knapsack problem. In: Proceedings of the International Conference on Operations Research Applications in Engineering and Management, Tiruchirappalli, India, May 2009 (ICOREM 2009), 2061\u20132064. Best OR Application in Engineering Award, sponsored by the Anna University, Tiruchirappalli. Accepted at the International Journal of Mathematics in Operations Research"},{"key":"680_CR18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.4064\/aa-9-3-257-260","volume":"9","author":"KF Roth","year":"1964","unstructured":"Roth KF (1964) Remark concerning integer sequences. Acta Arith 9:257\u2013260","journal-title":"Acta Arith"},{"issue":"2","key":"680_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s12469-009-0010-0","volume":"1","author":"A Sch\u00f6bel","year":"2009","unstructured":"Sch\u00f6bel A (2009) Capacity constraints in delay management. Public Transport 1(2):135\u2013154","journal-title":"Public Transport"}],"container-title":["Informatik-Spektrum"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0680-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00287-013-0680-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00287-013-0680-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T11:04:39Z","timestamp":1562670279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00287-013-0680-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,12]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s00287-013-0680-5","relation":{},"ISSN":["0170-6012","1432-122X"],"issn-type":[{"value":"0170-6012","type":"print"},{"value":"1432-122X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,12]]}}}