1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2024
Approximations and Hardness of Packing Partially Ordered Items
Ilan Doron-Arad, Guy Kortsarz, Joseph Naor +2
Motivated by applications in production planning and storage allocation in hierarchical databases, we initiate the study of covering partially ordered items (CPO). Given a capacity…
cs.DC2023★ 1 cited
Parallel Longest Common SubSequence Analysis In Chapel
Soroush Vahidi, Baruch Schieber, Zhihui Du +1
One of the most critical problems in the field of string algorithms is the longest common subsequence problem (LCS). The problem is NP-hard for an arbitrary number of strings but c…
cs.DS2023
Quick Minimization of Tardy Processing Time on a Single Machine
Baruch Schieber, Pranav Sitaraman
We consider the problem of minimizing the total processing time of tardy jobs on a single machine. This is a classical scheduling problem, first considered by [Lawler and Moore 196…