scientific article; zbMATH DE number 1445287

MaRDI QIDQ4952600zbMATH OpenFDO

Authors Hanno Lefmann

Publication date 16 April 2001

zbMATH Keywords

\(d\)-dimensional unit-cubeconfiguration of \(n\) pointsHeilbronn's problemrandomized polynomial time algorithm

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Randomized algorithms (68W20)

Recommendations

• On Heilbronn's problem in higher dimension
• A lower bound for Heilbronn's triangle problem in d dimensions
• Generalizations of Heilbronn's triangle problem
• scientific article; zbMATH DE number 1305394
• The on-line Heilbronn's triangle problem

Cited in

(10)

• The on-line Heilbronn's triangle problem
• On Heilbronn's problem in higher dimension
• A lower bound for Heilbronn's triangle problem in d dimensions
• scientific article; zbMATH DE number 3977838 (Why is no real title available?)
• scientific article; zbMATH DE number 1078400 (Why is no real title available?)
• An Algorithm for Heilbronn's Problem
• A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
• On a Problem of Heilbronn, II
• Galvin’s problem in higher dimensions
• Upper bounds for Heilbronn's triangle problem in higher dimensions

This page was built for publication:

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