Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs von Doron-Arad, Ilan, Shachnai, Hadas

Volltext

Representative families: A unified tradeoff-based approach von Shachnai, Hadas, Zehavi, Meirav

Volltext

An FPTAS for budgeted laminar matroid independent set von Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

Volltext

Improved approximation for two-dimensional vector multiple knapsack von Cohen, Tomer, Kulik, Ariel, Shachnai, Hadas

Volltext

A multivariate framework for weighted FPT algorithms von Shachnai, Hadas, Zehavi, Meirav

Volltext

The preemptive resource allocation problem von Sarpatwar, Kanthi, Schieber, Baruch, Shachnai, Hadas

Volltext

Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints von Kulik, Ariel, Shachnai, Hadas, Tamir, Tami

Volltext

Parameterized Algorithms for Graph Partitioning Problems von Shachnai, Hadas, Zehavi, Meirav

Volltext

On Lagrangian relaxation for constrained maximization and reoptimization problems von Kulik, Ariel, Shachnai, Hadas, Tamir, Gal

Volltext

A refined analysis of submodular Greedy von Kulik, Ariel, Schwartz, Roy, Shachnai, Hadas

Volltext

There is no EPTAS for two-dimensional knapsack von Kulik, Ariel, Shachnai, Hadas

Volltext

Parameterized approximation via fidelity preserving transformations von Fellows, Michael R., Kulik, Ariel, Rosamond, Frances, Shachnai, Hadas

Volltext

The Euclidean k-Supplier Problem von Nagarajan, Viswanath, Schieber, Baruch, Shachnai, Hadas

Volltext

Constrained submodular maximization via greedy local search von Sarpatwar, Kanthi K., Schieber, Baruch, Shachnai, Hadas

Volltext

Flexible Resource Allocation to Interval Jobs von Katz, Dmitriy, Schieber, Baruch, Shachnai, Hadas

Volltext

A Theory and Algorithms for Combinatorial Reoptimization von Schieber, Baruch, Shachnai, Hadas, Tamir, Gal, Tamir, Tami

Volltext

Flexible bandwidth assignment with application to optical networks von Shachnai, Hadas, Voloshin, Ariella, Zaks, Shmuel

Volltext

An almost optimal approximation algorithm for monotone submodular multiple knapsack von Fairstein, Yaron, Kulik, Ariel, Naor, Joseph (Seffi), Raz, Danny, Shachnai, Hadas

Volltext

Deterministic parameterized algorithms for the Graph Motif problem von Pinter, Ron Y., Shachnai, Hadas, Zehavi, Meirav

Volltext

Approximating Bin Packing with Conflict Graphs via Maximization Techniques von Doron-Arad, Ilan, Shachnai, Hadas

Volltext