1 citations · 1 across the 6 of their papers we have counts for
6 papers
Sorting by Strip Swaps is NP-Hard
Swapnoneel Roy, Asai Asaithambi, Debajyoti Mukhopadhyay
We show that \emph{Sorting by Strip Swaps} (SbSS) is NP-hard by a polynomial reduction of \emph{Block Sorting}. The key idea is a local gadget, a \emph{cage}, that replaces every d…
Greener Deep Reinforcement Learning: Analysis of Energy and Carbon Efficiency Across Atari Benchmarks
Jason Gardner, Ayan Dutta, Swapnoneel Roy +2
The growing computational demands of deep reinforcement learning (DRL) have raised concerns about the environmental and economic costs of training large-scale models. While algorit…
Waterberry Farms: A Novel Benchmark For Informative Path Planning
Samuel Matloob, Partha P. Datta, O. Patrick Kreidl +3
Recent developments in robotic and sensor hardware make data collection with mobile robots (ground or aerial) feasible and affordable to a wide population of users. The newly emerg…
On Approximability of Block Sorting
N. S. Narayanaswamy, Swapnoneel Roy
Block Sorting is a well studied problem, motivated by its applications in Optical Character Recognition (OCR), and Computational Biology. Block Sorting has been shown to be NP-Hard…
An FPTAS for the Lead-Based Multiple Video Transmission LMVT Problem
Swapnoneel Roy, Atri Rudra
The Lead-Based Multiple Video Transmission (LMVT) problem is motivated by applications in managing the quality of experience (QoE) of video streaming for mobile clients. In an earl…
On Sorting by Bounded Block Interchanges
Swapnoneel Roy
In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interc…