Parameterized Complexity for Query Subset Optimization

This paper introduces an application of parameterized complexity to the query subset selection problem. The main focus is to present a solution for query subset selection using dynamic programming taking into consideration a parameter. This approach provides an algorithm that is Fixed Parameter Tractable (FPT) in nature. Experimental results validate the efficiency of this method, proving the practical applications in optimizing query performance. This paper aims to introduce a parameterized complexity approach to the domain of Information Retrieval.