2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DS2022★ 2 cited
Travelling Salesman Problem: Parallel Implementations & Analysis
Amey Gohil, Manan Tayal, Tezan Sahu +1
The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and operations research. It is an NP-Hard problem focused on opt…
cs.IR2021★ 1 cited
Lookup or Exploratory: What is Your Search Intent?
Manoj K. Agarwal, Tezan Sahu
Search query specificity is broadly divided into two categories - Exploratory or Lookup. If a query specificity can be identified at the run time, it can be used to significantly i…