A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
From MaRDI portal
Publication:4785628
DOI10.1137/S0097539701395115zbMath1008.68161MaRDI QIDQ4785628
Publication date: 5 January 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Combinatorics in computer science (68R05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (5)
Large triangles in the \(d\)-dimensional unit cube ⋮ 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 ⋮ Generalizations of Heilbronn's triangle problem
This page was built for publication: A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions
