✦ LIBER ✦

The weighted sum of split and diameter clustering

✍ Scribed by Y. Wang; H. Yan; C. Sriskandarajah

Publisher: Springer
Year: 1996
Tongue: English
Weight: 851 KB
Volume: 13
Category: Article
ISSN: 0176-4268
DOI: 10.1007/bf01246100

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum sum of diameters clustering

✍ P. Hansen; B. Jaumard 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 646 KB

Maximum sum-of-splits clustering

✍ P. Hansen; B. Jaumard; O. Frank 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 1009 KB

Rates of clustering in FLIL for weighted

Rates of clustering in FLIL for weighted partial sum processes

✍ Charles El-Nouty 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Minimizing the sum of diameters efficien

Minimizing the sum of diameters efficiently

✍ John Hershberger 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 553 KB

The searchlight guarding problem on weig

The searchlight guarding problem on weighted split graphs and weighted cographs

✍ Yen, William C. K.; Tang, C. Y. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 2 views

This paper addresses the searchlight guarding problem, which is an extension of so-called graph searching/guarding problem on a weighted, undirected graph G by considering the time-slot parameter in addition to the traditional building cost. Given a weighted, undirected graph G G G, suppose that the

Monochromatic and zero-sum sets of nonde

Monochromatic and zero-sum sets of nondecreasing diameter

✍ Arie Bialostocki; Paul Erdös; Hanno Lefmann 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 721 KB