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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 81; číslo 2; s. 398 - 414
Hlavní autori:	De, Minati, Nandy, Subhas C., Roy, Sasanka
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.03.2015
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!