✦ LIBER ✦

The Minimum Covering Sphere Problem

✍ Scribed by Elzinga, D. J.; Hearn, D. W.

Book ID: 115494512
Publisher: INFORMS
Year: 1972
Tongue: English
Weight: 557 KB
Volume: 19
Category: Article
ISSN: 0025-1909
DOI: 10.1287/mnsc.19.1.96

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum sphere covering a convex pol

The minimum sphere covering a convex polyhedron

✍ Jack Elzinga; Donald Hearn 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

The Minimum-Covering/Shortest-Path Probl

The Minimum-Covering/Shortest-Path Problem

✍ John Current; Charles ReVelle; Jared Cohon 📂 Article 📅 1988 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 738 KB

The Probabilistic Minimum Vertex-coverin

The Probabilistic Minimum Vertex-covering Problem

✍ Cécile Murat; Vangelis Th. Paschos 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

Fuzzy minimum weight edge covering probl

Fuzzy minimum weight edge covering problem

✍ Yaodong Ni 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 184 KB

The Minimum Substring Cover problem

✍ Danny Hermelin; Dror Rawitz; Romeo Rizzi; Stéphane Vialette 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Equivalence between the minimum covering

Equivalence between the minimum covering problem and the maximum matching problem

✍ Ján Plesník 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 127 KB

The minimum covering problem in weighted graphs with n vertices is transformed in time O(n 2) to the maximum matching problem with n or n + 1 vertices, and conversely.