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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

6 被引用数 (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.

本文言語英語
ホスト出版物のタイトルApproximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers
ページ93-106
ページ数14
DOI
出版ステータス出版済み - 2013
イベント10th International Workshop on Approximation and Online Algorithms, WAOA 2012 - Ljubljana, スロベニア
継続期間: 9 13 20129 14 2012

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7846 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他10th International Workshop on Approximation and Online Algorithms, WAOA 2012
国/地域スロベニア
CityLjubljana
Period9/13/129/14/12

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On minimum-and maximum-weight minimum spanning trees with neighborhoods」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル