Prune-and-search with limited workspace

Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and show how to implement it in space-efficient manner. We consider both the in-place and read-only model which have several advantages compared...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences Jg. 81; H. 2; S. 398 - 414
Hauptverfasser: De, Minati, Nandy, Subhas C., Roy, Sasanka
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.03.2015
Schlagworte:
In-place algorithms
Low dimensional linear programming
Minimum enclosing circle
Prune-and-search
Read-only memory algorithms
Space-efficient algorithms
Space-efficient algorithms
Prune-and-search
Low dimensional linear programming
In-place algorithms
Read-only memory algorithms
Minimum enclosing circle
ISSN:0022-0000, 1090-2724
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Prune-and-search is an excellent algorithmic paradigm for solving various optimization problems. We provide a general scheme for prune-and-search technique and show how to implement it in space-efficient manner. We consider both the in-place and read-only model which have several advantages compared to the traditional model of computation. Our technique can be applied to a large number of problems which accept prune-and-search. For examples, we study the following problems each of which has tremendous practical usage apart from theoretical implication:•computing the minimum enclosing circle (MEC) of a set of n points in R2, and•linear programming problems with two and three variables and n constraints. In the in-place setting, all these problems can be solved in O(n) time using O(1) extra-space. In the read-only setup, the time and extra-space complexities of the proposed algorithms for all these problems are O(npolylog(n)) and O(polylog(n)), respectively.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2014.08.001