✦ LIBER ✦

Minimum-diameter covering problems

✍ Scribed by Esther M. Arkin; Refael Hassin

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 181 KB
Volume: 36
Category: Article
ISSN: 0028-3045
DOI: 10.1002/1097-0037(200010)36:3<147::aid-net1>3.0.co;2-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hybrid heuristics for minimum cardinalit

Hybrid heuristics for minimum cardinality set covering problems

✍ Francis J. Vasko; George R. Wilson 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB

On the minimum-cardinality-bounded-diame

On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems

✍ Chung-Lun Li; S.Thomas McCormick; David Simchi-Levi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 331 KB

On the minimum diameter spanning tree pr

On the minimum diameter spanning tree problem

✍ Refael Hassin; Arie Tamir 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 199 KB

Fuzzy minimum weight edge covering probl

Fuzzy minimum weight edge covering problem

✍ Yaodong Ni 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 184 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.

Minimum restricted diameter spanning tre

Minimum restricted diameter spanning trees

✍ Refael Hassin; Asaf Levin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 304 KB

Let G = (V; E) be a requirement graph. Let d = (dij) n i; j=1 be a length metric. For a tree T denote by dT (i; j) the distance between i and j in T (the length according to d of the unique i -j path in T ). The restricted diameter of T , DT , is the maximum distance in T between pair of vertices wi