Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Packing Linear Programs and Fractional Knapsack using Comparison Oracles
Ritabrata Barat, Siddharth Barman, Nirjhar Das +1
We study the problem of recovering the objective of a packing linear program when the algorithm accesses only comparison information about optimal solutions under varying constrain…
cs.DS2026
Welfarist Formulations for Diverse Similarity Search
Siddharth Barman, Nirjhar Das, Shivam Gupta +1
Nearest Neighbor Search (NNS) is a fundamental problem in data structures with wide-ranging applications, such as web search, recommendation systems, and, more recently, retrieval-…