A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions

DOI10.1137/S0097539701395115MaRDI QIDQ4785628zbMATH OpenFDO

Authors Hanno Lefmann, Niels Schmitt

Publication date 5 January 2003

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

Full work available at URL https://doi.org/10.1137/S0097539701395115

zbMATH Keywords

arrangements of simplicesHeilbronn's triangle problemindependent sets in hypergraphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2086227
• An Algorithm for Heilbronn's Problem
• Generalizations of Heilbronn's triangle problem
• On Heilbronn's problem in higher dimension
• Publication:4952600

Cited in

(8)

• Generalizations of Heilbronn's triangle problem
• Distributions of points in the unit square and large \(k\)-gons
• scientific article; zbMATH DE number 2086227 (Why is no real title available?)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness
• An Algorithm for Heilbronn's Problem
• Large triangles in the \(d\)-dimensional unit cube
• Distributions of points in \(d\) dimensions and large \(k\) -point simplices

This page was built for publication: A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785628)