Generalized spanning trees

Moshe Dror, M. Haouari, J. Chaouachi

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

In this paper, we propose a definition for the Generalized Minimal Spanning Tree (GMST) of a graph. The GMST requires spanning at least one node out of every set of disjoint nodes (node partition) in a graph. The analysis of the GMST problem is motivated by real life agricultural settings related to construction of irrigation networks in desert environments. We prove that the GMST problem is NP-hard, and examine a number of heuristic solutions for this problem. Computational experiments comparing these heuristics are presented.

Original languageEnglish (US)
Pages (from-to)583-592
Number of pages10
JournalEuropean Journal of Operational Research
Volume120
Issue number3
DOIs
StatePublished - Feb 1 2000

Fingerprint

Minimal Spanning Tree
Spanning tree
Irrigation
Computational complexity
heuristics
Vertex of a graph
Experiments
Heuristics
desert
irrigation
Graph in graph theory
Computational Experiments
Disjoint
NP-complete problem
experiment
Partition
Node
Graph

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Generalized spanning trees. / Dror, Moshe; Haouari, M.; Chaouachi, J.

In: European Journal of Operational Research, Vol. 120, No. 3, 01.02.2000, p. 583-592.

Research output: Contribution to journalArticle

Dror, Moshe ; Haouari, M. ; Chaouachi, J. / Generalized spanning trees. In: European Journal of Operational Research. 2000 ; Vol. 120, No. 3. pp. 583-592.
@article{eda0c7705a4f4c3ca3c075ad3dc6d28b,
title = "Generalized spanning trees",
abstract = "In this paper, we propose a definition for the Generalized Minimal Spanning Tree (GMST) of a graph. The GMST requires spanning at least one node out of every set of disjoint nodes (node partition) in a graph. The analysis of the GMST problem is motivated by real life agricultural settings related to construction of irrigation networks in desert environments. We prove that the GMST problem is NP-hard, and examine a number of heuristic solutions for this problem. Computational experiments comparing these heuristics are presented.",
author = "Moshe Dror and M. Haouari and J. Chaouachi",
year = "2000",
month = "2",
day = "1",
doi = "10.1016/S0377-2217(99)00006-5",
language = "English (US)",
volume = "120",
pages = "583--592",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Generalized spanning trees

AU - Dror, Moshe

AU - Haouari, M.

AU - Chaouachi, J.

PY - 2000/2/1

Y1 - 2000/2/1

N2 - In this paper, we propose a definition for the Generalized Minimal Spanning Tree (GMST) of a graph. The GMST requires spanning at least one node out of every set of disjoint nodes (node partition) in a graph. The analysis of the GMST problem is motivated by real life agricultural settings related to construction of irrigation networks in desert environments. We prove that the GMST problem is NP-hard, and examine a number of heuristic solutions for this problem. Computational experiments comparing these heuristics are presented.

AB - In this paper, we propose a definition for the Generalized Minimal Spanning Tree (GMST) of a graph. The GMST requires spanning at least one node out of every set of disjoint nodes (node partition) in a graph. The analysis of the GMST problem is motivated by real life agricultural settings related to construction of irrigation networks in desert environments. We prove that the GMST problem is NP-hard, and examine a number of heuristic solutions for this problem. Computational experiments comparing these heuristics are presented.

UR - http://www.scopus.com/inward/record.url?scp=0033908431&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033908431&partnerID=8YFLogxK

U2 - 10.1016/S0377-2217(99)00006-5

DO - 10.1016/S0377-2217(99)00006-5

M3 - Article

AN - SCOPUS:0033908431

VL - 120

SP - 583

EP - 592

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -