Ilan Doron-Arad

activity

20202026

most citedOn the Hardness of Training Deep Neural Networks Discretely

1 citations · 1 across the 16 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.DS2022

Bin Packing with Partition Matroid can be Approximated within $o (O P T)$ Bins

Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai

We consider the Bin Packing problem with a partition matroid constraint. The input is a set of items of sizes in $(0, 1]$ , and a partition matroid over the items. The goal is to pac…

cs.DS2022

An EPTAS for Budgeted Matroid Independent Set

Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai

We consider the budgeted matroid independent set problem. The input is a ground set, where each element has a cost and a non-negative profit, along with a matroid over the elements…

Bin Packing with Partition Matroid can be Approximated within o(OPT) Bins

An EPTAS for Budgeted Matroid Independent Set

Bin Packing with Partition Matroid can be Approximated within $o (O P T)$ Bins