Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

by   Bahareh Banyassady, et al.

In the limited-workspace model, we assume that the input of size n lies in a random access read-only memory. The output has to be reported sequentially, and it cannot be accessed or modified. In addition, there is a read-write workspace of O(s) words, where s ∈{1, ..., n} is a given parameter. In a time-space trade-off, we are interested in how the running time of an algorithm improves as s varies from 1 to n. We present a time-space trade-off for computing the Euclidean minimum spanning tree (EMST) of a set V of n sites in the plane. We present an algorithm that computes EMST(V) using O(n^3 s /s^2) time and O(s) words of workspace. Our algorithm uses the fact that EMST(V) is a subgraph of the bounded-degree relative neighborhood graph of V, and applies Kruskal's MST algorithm on it. To achieve this with limited workspace, we introduce a compact representation of planar graphs, called an s-net which allows us to manipulate its component structure during the execution of the algorithm.


page 1

page 2

page 3

page 4


A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-off Algorithms

We are given a read-only memory for input and a write-only stream for ou...

A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners

Given a 2-edge connected undirected graph G with n vertices and m edges,...

A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon

In this paper we study the problem of computing the geodesic center of a...

Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs

A graph separator is a subset of vertices of a graph whose removal divid...

Improved Time-Space Trade-offs for Computing Voronoi Diagrams

Let P be a planar set of n sites in general position. For k∈{1,...,n-1},...

Computing treedepth in polynomial space and linear fpt time

The treedepth of a graph G is the least possible depth of an elimination...

Geometric Algorithms with Limited Workspace: A Survey

In the limited workspace model, we consider algorithms whose input resid...

Please sign up or login with your details

Forgot password? Click here to reset