3 papers
cs.DS2021
Efficient Reporting of Top-k Subset Sums
Biswajit Sanyal, Subhashis Majumder, Priya Ranjan Sinha Mahapatra
The "Subset Sum problem" is a very well-known NP-complete problem. In this work, a top-k variation of the "Subset Sum problem" is considered. This problem has wide application in r…
cs.CG2018
Maximum-Width Empty Square and Rectangular Annulus
Sang Won Bae, Arpita Baral, Priya Ranjan Sinha Mahapatra
An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with…
cs.CG2017
Maximum-width Axis-Parallel Empty Rectangular Annulus
Arpita Baral, Abhilash Gondane, Sanjib Sadhu +1
Given a set of points on , we address the problem of computing an axis-parallel empty rectangular annulus of maximum-width such that no point of lies…