𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Optimality of Coloring with a Lattice

✍ Scribed by Ben-Haim, Yael; Etzion, Tuvi

Book ID
118198091
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
460 KB
Volume
18
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Colored monopoles on the lattice
Colored monopoles on the lattice
✍ Mark Srednicki; Leonard Susskind πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 584 KB
Coloring a graph optimally with two colo
Coloring a graph optimally with two colors
✍ H.J. Broersma; F. GΓΆbel πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 536 KB

Let G be a graph with point set V. A (2.)c,oloring of G is a map of V to ired, white!. An error occurs whenever the two endpoints of a line have the same color. An oprimul doring of G is a coloring of G for which the number of errors is minimum. The minimum number of errors is denoted by y(G), we de

A Note on Optimal Unimodular Lattices
A Note on Optimal Unimodular Lattices
✍ J.H Conway; N.J.A Sloane πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 169 KB

The highest possible minimal norm of a unimodular lattice is determined in dimensions n 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8.10 20 in dimension 33). Unimodular lattices with no roots exist if and only if n 23, n{25

On the optimality of Aβˆ—
On the optimality of Aβˆ—
✍ David Gelperin πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 438 KB

After discussing difficulties with previous proofs of A\*'s ootimality, new proofs are presented. In addition, examples are used to show: (1) that the value of (~n) may be a function of the state of the search as well as the al~ailable heuristic information and ( 2) that there exist admissible searc