{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:37:29Z","timestamp":1736314649201,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045069","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T14:16:11Z","timestamp":1139235371000},"page":"23-31","source":"Crossref","is-referenced-by-count":2,"title":["An algorithm for Heilbronn's problem"],"prefix":"10.1007","author":[{"given":"Claudia","family":"Bertram-Kretzberg","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Hofmeister","sequence":"additional","affiliation":[]},{"given":"Hanno","family":"Lefmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M. Ajtai","year":"1982","unstructured":"M. Ajtai, J. Koml\u00f3s, J. Pintz, J. Spencer and E. Szemer\u00e9di, Extremal Uncrowded Hypergraphs, Journal of Combinatorial Theory Ser. A, 32 (1982), 321\u2013335.","journal-title":"Journal of Combinatorial Theory Ser. A"},{"key":"4_CR2","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"N. Alon and J. Spencer, The Probabilistic Method, Wiley & Sons, New York (1992)."},{"key":"4_CR3","unstructured":"C. Bertram-Kretzberg and H. Lefmann, The Algorithmic Aspects of Uncrowded Hypergraphs, Proc. 8th ACM-SIAM Symposium on Discrete Algorithms SODA (1997), 296\u2013304."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<131::AID-RSA4>3.0.CO;2-Z","volume":"8","author":"A. Fundia","year":"1996","unstructured":"A. Fundia, Derandomizing Chebychev's Inequality to find Independent Sets in Uncrowded Hypergraphs, Random Structures & Algorithms, 8 (1996), 131\u2013147.","journal-title":"Random Structures & Algorithms"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, Clique is Hard to Approximate Within n 1\u2212\u03b5, Proc. 37th IEEE Symposium on Foundations of Computer Science FOGS (1996), 627\u2013636.","DOI":"10.1109\/SFCS.1996.548522"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1112\/jlms\/s2-25.1.13","volume":"25","author":"J. Koml\u00f3s","year":"1982","unstructured":"J. Koml\u00f3s, J. Pintz and E. Szemer\u00e9di, A Lower Bound for Heilbronn's Problem, Journal of the London Mathematical Society, 25 (1982), 13\u201324.","journal-title":"Journal of the London Mathematical Society"},{"key":"4_CR7","unstructured":"I. Niven, H. S. Zuckerman and H. L. Montgomery, An Introduction to the Theory of Numbers, John Wiley & Sons, 5th ed. (1991)."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs, Journal of Computer and System Sciences 37 (1988), 130\u2013143.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"4_CR9","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1112\/plms\/s3-25.3.543","volume":"25","author":"K. F. Roth","year":"1972","unstructured":"K. F. Roth, On a Problem of Heilbronn III, Proc. of the London Mathematical Society (3) 25 (1972), 543\u2013549.","journal-title":"Proc. of the London Mathematical Society"},{"issue":"2","key":"4_CR10","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1112\/jlms\/s2-4.3.545","volume":"4","author":"W. M. Schmidt","year":"1972","unstructured":"W. M. Schmidt, On a Problem of Heilbronn, Journal of the London Mathematical Society (2), 4 (1972), 545\u2013550.","journal-title":"Journal of the London Mathematical Society"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","volume":"2","author":"J. Spencer","year":"1972","unstructured":"J. Spencer, Tur\u00e1n's Theorem for k-Graphs, Discrete Mathematics, 2 (1972), 183\u2013186.","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T16:30:29Z","timestamp":1736267429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0045069","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}