✦ LIBER ✦

On the prize-collecting generalized minimum spanning tree problem

✍ Scribed by P. C. Pop

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 289 KB
Volume: 150
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-006-0153-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the generalized minimum spanning tree

On the generalized minimum spanning tree problem

✍ Young-Soo Myung; Chang-Ho Lee; Dong-Wan Tcha 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 748 KB

Relaxation methods for the Generalized M

Relaxation methods for the Generalized Minimum Spanning Tree Problem

✍ P.C. Pop; W. Kern; G. Still; U. Faigle 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 185 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

The geometric generalized minimum spanni

The geometric generalized minimum spanning tree problem with grid clustering

✍ Corinne Feremans; Alexander Grigoriev; René Sitters 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 212 KB

The quadratic minimum spanning tree prob

The quadratic minimum spanning tree problem

✍ Arjang Assad; Weixuan Xu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 893 KB

Variations of the prize-collecting Stein

Variations of the prize-collecting Steiner tree problem

✍ Olena Chapovska; Abraham P. Punnen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract The prize‐collecting Steiner tree problem is well known to be NP‐hard. We consider seven variations of this problem generalizing several well‐studied bottleneck and minsum problems with feasible solutions as trees of a graph. Four of these problems are shown to be solvable in __O__(__m_