3 citations · 3 across the 6 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
Adrian Calinescu, Gruia Calinescu
Let f:2^N --> \cZ^+ be a polymatroid (an integer-valued non-decreasing submodular set function with f(emptyset) = 0). A k-polymatroid satisfies that f(e) <= k for all e in N. We ca…
cs.DS2026
Busy Time Minimization with Preemption, Migration, and One Resource Requirement
Gruia Calinescu, Mozhengfu Liu
We study the Busy Machine Time with Preemption and Migration and One Resource Requirement problem, motivated by energy minimization in cloud data centers. Given unlimited identical…
cs.DS2026
On Randomized Online Span Minimization
Adrian Calinescu, Gruia Calinescu, Peng-Jun Wan
We study the online Busy Time scheduling model on a single machine of unbounded capacity, with non-preemptive jobs. In our setting, flexible jobs arrive online with a processing ti…