On minimum-and maximum-weight minimum spanning trees with neighborhoods

Reza Dorrigiv, Robert Fraser, Meng He, Shahin Kamali, Akitoshi Kawamura, Alejandro López-Ortiz, Diego Seco

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)


We study optimization problems for the Euclidean minimum spanning tree (MST) on imprecise data. To model imprecision, we accept a set of disjoint disks in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. We consider both minimizing and maximizing the weight of the MST over the input. The minimum weight version of the problem is known as the minimum spanning tree with neighborhoods (MSTN) problem, and the maximum weight version (MAX-MSTN) has not been studied previously to our knowledge. We provide deterministic and parameterized approximation algorithms for the MAX-MSTN problem, and a parameterized algorithm for the MSTN problem. Additionally, we present hardness of approximation proofs for both settings.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers
Number of pages14
Publication statusPublished - 2013
Externally publishedYes
Event10th International Workshop on Approximation and Online Algorithms, WAOA 2012 - Ljubljana, Slovenia
Duration: Sept 13 2012Sept 14 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7846 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other10th International Workshop on Approximation and Online Algorithms, WAOA 2012

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On minimum-and maximum-weight minimum spanning trees with neighborhoods'. Together they form a unique fingerprint.

Cite this