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

5 Citations (Scopus)

Abstract

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
Pages93-106
Number of pages14
DOIs
Publication statusPublished - Dec 1 2013
Externally publishedYes
Event10th International Workshop on Approximation and Online Algorithms, WAOA 2012 - Ljubljana, Slovenia
Duration: Sep 13 2012Sep 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

Other

Other10th International Workshop on Approximation and Online Algorithms, WAOA 2012
CountrySlovenia
CityLjubljana
Period9/13/129/14/12

Fingerprint

Minimum Spanning Tree
Approximation algorithms
Hardness
Parameterized Algorithms
Hardness of Approximation
Imprecise Data
Imprecision
Set of points
Approximation Algorithms
Euclidean
Disjoint
Optimization Problem

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Dorrigiv, R., Fraser, R., He, M., Kamali, S., Kawamura, A., López-Ortiz, A., & Seco, D. (2013). On minimum-and maximum-weight minimum spanning trees with neighborhoods. In Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers (pp. 93-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7846 LNCS). https://doi.org/10.1007/978-3-642-38016-7_9

On minimum-and maximum-weight minimum spanning trees with neighborhoods. / Dorrigiv, Reza; Fraser, Robert; He, Meng; Kamali, Shahin; Kawamura, Akitoshi; López-Ortiz, Alejandro; Seco, Diego.

Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers. 2013. p. 93-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7846 LNCS).

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

Dorrigiv, R, Fraser, R, He, M, Kamali, S, Kawamura, A, López-Ortiz, A & Seco, D 2013, On minimum-and maximum-weight minimum spanning trees with neighborhoods. in Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7846 LNCS, pp. 93-106, 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, Ljubljana, Slovenia, 9/13/12. https://doi.org/10.1007/978-3-642-38016-7_9
Dorrigiv R, Fraser R, He M, Kamali S, Kawamura A, López-Ortiz A et al. On minimum-and maximum-weight minimum spanning trees with neighborhoods. In Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers. 2013. p. 93-106. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-38016-7_9
Dorrigiv, Reza ; Fraser, Robert ; He, Meng ; Kamali, Shahin ; Kawamura, Akitoshi ; López-Ortiz, Alejandro ; Seco, Diego. / On minimum-and maximum-weight minimum spanning trees with neighborhoods. Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers. 2013. pp. 93-106 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{eaaba1cedd124d3ca1ff5b00cee00a78,
title = "On minimum-and maximum-weight minimum spanning trees with neighborhoods",
abstract = "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.",
author = "Reza Dorrigiv and Robert Fraser and Meng He and Shahin Kamali and Akitoshi Kawamura and Alejandro L{\'o}pez-Ortiz and Diego Seco",
year = "2013",
month = "12",
day = "1",
doi = "10.1007/978-3-642-38016-7_9",
language = "English",
isbn = "9783642380150",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "93--106",
booktitle = "Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers",

}

TY - GEN

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

AU - Dorrigiv, Reza

AU - Fraser, Robert

AU - He, Meng

AU - Kamali, Shahin

AU - Kawamura, Akitoshi

AU - López-Ortiz, Alejandro

AU - Seco, Diego

PY - 2013/12/1

Y1 - 2013/12/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/978-3-642-38016-7_9

DO - 10.1007/978-3-642-38016-7_9

M3 - Conference contribution

AN - SCOPUS:84894170611

SN - 9783642380150

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 93

EP - 106

BT - Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers

ER -