{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:56:42Z","timestamp":1725544602199},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333395"},{"type":"electronic","value":"9783540333401"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11734673_13","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T21:59:04Z","timestamp":1151963944000},"page":"161-172","source":"Crossref","is-referenced-by-count":1,"title":["Relational Implementation of Simple Parallel Evolutionary Algorithms"],"prefix":"10.1007","author":[{"given":"Britta","family":"Kehden","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Berghammer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/BFb0053599","volume-title":"Proc. 1st Conf. Fundamental Approaches to Software Engineering","author":"R. Behnke","year":"1998","unstructured":"Behnke, R., Berghammer, R., Meyer, E., Schneider, P.: RelView \u2014 A system for calculation with relations and relational programming. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol.\u00a01382, pp. 318\u2013321. Springer, Heidelberg (1998)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45013-0_12","volume-title":"Logic Based Program Synthesis and Transformation","author":"R. Berghammer","year":"2003","unstructured":"Berghammer, R.: A generic program for minimal subsets with applications. In: Leuschel, M.A. (ed.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 144\u2013157. Springer, Heidelberg (2003)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Berghammer, R., Hoffmann, T., Leoniuk, B., Milanese, U.: Prototyping and programming with relations. Electronic Notes in Theoretical Computer Science\u00a044 (2003)","DOI":"10.1016\/S1571-0661(04)80931-9"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-36280-0_17","volume-title":"Relational Methods in Computer Science","author":"R. Berghammer","year":"2002","unstructured":"Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of relational algebra using binary decision diagrams. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol.\u00a02561, pp. 241\u2013257. Springer, Heidelberg (2002)"},{"key":"13_CR5","volume-title":"Introduction to algorithms","author":"T.T. Cormen","year":"1990","unstructured":"Cormen, T.T., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. The MIT Press, Cambridge (1990)"},{"key":"13_CR6","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In: Proc. 11th Ann.\u00a0ACM-SIAM Symp.\u00a0on Discrete Algorithms, ACM-SIAM (2000)"},{"key":"13_CR7","volume-title":"Introduction to combinatorial optimization, randomization, approximation, and heuristics","author":"J. Hromkovic","year":"2001","unstructured":"Hromkovic, J.: Algorithms for hard problems. In: Introduction to combinatorial optimization, randomization, approximation, and heuristics. Springer, Heidelberg (2001)"},{"key":"13_CR8","unstructured":"Leoniuk, B.: ROBDD-based implementation of relational algebra with applications (in German). Ph.D.\u00a0thesis, Inst. f\u00fcr Inf. und Prak. Math., Univ. Kiel (2001)"},{"key":"13_CR9","unstructured":"Milanese, U.: On the implementation of a ROBDD-based tool for the manipulation and visualization of relations (in German). Ph.D.\u00a0thesis, Inst. f\u00fcr Inf. und Prak. Math., Univ. Kiel (2003)"},{"key":"13_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-77968-8","volume-title":"Relations and graphs","author":"G. Schmidt","year":"1993","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and graphs. Springer, Heidelberg (1993)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching programs and binary decision diagrams \u2013 theory and applications. SIAM Monographs on Discr. Math. and Appl. (2000)","DOI":"10.1137\/1.9780898719789"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T19:24:55Z","timestamp":1555701895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11734673_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}