Generalized spanning trees

M. Dror, M. Haouari, J. Chaouachi

Research output: Contribution to journalArticle

43 Scopus citations

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Generalized spanning trees'. Together they form a unique fingerprint.

  • Cite this