An Algorithm for Heilbronn's Problem

DOI10.1137/S0097539798348870zbMath0968.68065MaRDI QIDQ4507356

Hanno Lefmann, Claudia Bertram-Kretzberg, Thomas Hofmeister

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

hypergraphsindependent setstrianglesHeilbronn

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Discrete geometry (52C99)

Related Items (11)

The average‐case area of Heilbronn‐type triangles* ⋮ Large triangles in the \(d\)-dimensional unit cube ⋮ Heilbronn triangle‐type problems in the unit square [0,1²] ⋮ Heilbronn's problem of eight points in the square ⋮ Distributions of points in the unit square and large \(k\)-gons ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Distributions of points in \(d\) dimensions and large \(k\) -point simplices ⋮ Upper bounds for Heilbronn's triangle problem in higher dimensions ⋮ On Heilbronn triangle-type problems in higher dimensions ⋮ Point sets in the unit square and large areas of convex hulls of subsets of points ⋮ Generalizations of Heilbronn's triangle problem

This page was built for publication: An Algorithm for Heilbronn's Problem