11 citations · 19 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
To Store or Not to Store: a graph theoretical approach for Dataset Versioning
Anxin Guo, Jingwei Li, Pattara Sukprasert +3
In this work, we study the cost efficient data versioning problem, where the goal is to optimize the storage and reconstruction (retrieval) costs of data versions, given a graph of…
cs.DS2016
LP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time
Jessica Chang, Samir Khuller, Koyel Mukherjee
We consider fundamental scheduling problems motivated by energy issues. In this framework, we are given a set of jobs, each with a release time, deadline and required processing le…