Prune-and-search with limited workspace》.pdf

Journal of Computer and System Sciences 81 (2015) 398–414 Contents lists available at ScienceDirect Journal of Computer and System Sciences /locate/jcss Prune-and-search with limited workspace ✩ Minati De a,∗,1, Subhas C. Nandy b , Sasanka Roy c a The Technion—Israel Institute of Technology, Haifa 32000, Israel b Indian Statistical Institute, Kolkata 700108, India c Chennai Mathematical Institute, Chennai, 603103, India a r t i c l e i n f o a b s t r a c t Article history: Prune-and-search is an excellent algorithmic paradigm for solving various optimization Received 2 July 2013 problems. We provide a general scheme for prune-and-search technique and show how Accepted 31 July 2014 to implement it in space-efficient manner. We consider both the in-place and read-only Available online 4 September 2014 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- Keywords: Prune-and-search search. For examples, we study the following problems each of which has tremendous Space-efficient algorithms practical usage apart from theoretical implication: In-place algorithms Read-only memory algorithms