On determining the cover of a simplex by spheres centered at its vertices

L.G. Casado, I. García, B.G. Tóth, E.M.T. Hendrix

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)

Abstract

The aim of this work is to study the Simplex Cover (SC) problem, which is to determine whether a given simplex is covered by spheres centered at its vertices. We show that the SC problem is equivalent to a global optimization problem. We investigate its characteristics.
Original languageEnglish
Pages (from-to)645-655
JournalJournal of Global Optimization
Volume50
Issue number4
DOIs
Publication statusPublished - 2011

Keywords

  • Covering
  • Simplex
  • Spheres

Fingerprint

Dive into the research topics of 'On determining the cover of a simplex by spheres centered at its vertices'. Together they form a unique fingerprint.

Cite this