Faster algorithms for the minimum red-blue-purple spanning graph problem

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

DOI

  • Ahmad Biniaz, Carleton University
  • ,
  • Prosenjit Bose, Carleton University
  • ,
  • Ingo van Duijn
  • ,
  • Anil Maheshwari, Carleton University
  • ,
  • Michiel Smid, Carleton University

Consider a set of n points in the plane, each one of which is colored either red, blue, or purple. A red-blue-purple spanning graph (RBP spanning graph) is a graph whose vertices are the points and whose edges connect the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. The minimum RBP spanning graph problem is to find an RBP spanning graph with minimum total edge length. First we consider this problem for the case when the points are located on a circle. We present an algorithm that solves this problem in O(n2) time, improving upon the previous algorithm by a factor of Θ(n). Also, for the general case we present an algorithm that runs in O(n5) time, improving upon the previous algorithm by a factor of Θ(n).

OriginalsprogEngelsk
TidsskriftJournal of Graph Algorithms and Applications
Vol/bind21
Nummer4
Sider (fra-til)527-546
Antal sider20
ISSN1526-1719
DOI
StatusUdgivet - apr. 2017

Se relationer på Aarhus Universitet Citationsformater

ID: 118503401