Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

COMBINATORICS
2002

favoriteEmaildiscussreport

62views more COMBINATORICS 2002»

New Lower Bounds for Heilbronn Numbers

13 years 4 months ago

New Lower Bounds for Heilbronn Numbers

Download www.combinatorics.org

The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the points have area at least Hn. In this note we establish new bounds for the first Heilbronn numbers. These new values have been found by using a simple implementation of simulated annealing to obtain a first approximation and then optimizing the results by finding the nearest exact local maximum.

Francesc Comellas, J. Luis A. Yebra

Real-time Traffic

COMBINATORICS 2002 | Heilbronn Numbers | Largest Value | N-th Heilbronn Number |

claim paper

Related Content

» New Lower Bound Formulas for Multicolored Ramsey Numbers

» Bounds on the fading number of multipleinput singleoutput fading channels with memory

» CrossComposition A New Technique for Kernelization Lower Bounds

» New Lower Bounds for Some Multicolored Ramsey Numbers

» A new lower bound on the independence number of a graph

» New Lower Bounds of Constraint Violations for OverConstrained Problems

» New Monotones and Lower Bounds in Unconditional TwoParty Computation

» Symmetric SumFree Partitions and Lower Bounds for Schur Numbers

» Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	Francesc Comellas, J. Luis A. Yebra

Comments (0)