We study the budgeted laminar matroid independent set problem. The input is a ground set, where each element has a cost and a non-negative profit, along with a laminar matroid over the elements and a budget. The goal is to select a maximum profit independent set of the matroid whose total cost is bounded by the budget. We present a fully polynomial-time approximation scheme (FPTAS) for the problem, improving the previous efficient PTAS for this matroid family.
2023-11
2024-11-21