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: Contribution to journalArticlepeer-review

8 Citations (Scopus)

Abstract

We study optimization problems for the Euclidean Minimum Spanning Tree (MST) problem 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
Pages (from-to)220-250
Number of pages31
JournalTheory of Computing Systems
Volume56
Issue number1
DOIs
Publication statusPublished - Jan 1 2015

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods'. Together they form a unique fingerprint.

Cite this