Ariel Kulik

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 47

Top Topics

Optimization Problems

Multiple Knapsack

Top Venues

Oper. Res. Lett.

Publications

Baris Can Esmer, Ariel Kulik
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems. CoRR (2024)
Ilan Doron-Arad, Fabrizio Grandoni, Ariel Kulik
Unsplittable Flow on a Short Path. CoRR (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86 (1) (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA (2024)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP (2024)
Ilan Doron-Arad, Ariel Kulik, Pasin Manurangsi
Fine Grained Lower Bounds for Multidimensional Knapsack. CoRR (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. IPEC (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matroid Independent Set. SOSA (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. ICALP (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. APPROX/RANDOM (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Tight Lower Bounds for Weighted Matroid Problems. CoRR (2023)
Tomer Cohen, Ariel Kulik, Hadas Shachnai
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR (2023)
Tomer Cohen, Ariel Kulik, Hadas Shachnai
Improved Approximation for Two-dimensional Vector Multiple Knapsack. CoRR (2023)
Ariel Kulik, Matthias Mnich, Hadas Shachnai
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. CoRR (2023)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. 51 (6) (2023)
Ariel Kulik, Matthias Mnich, Hadas Shachnai
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR (2022)
Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel Sadoc Menasché
Data Plane Cooperative Caching With Dependencies. IEEE Trans. Netw. Serv. Manag. 19 (3) (2022)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An EPTAS for Budgeted Matroid Independent Set. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. CoRR (2022)
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. 125 (2022)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. IPEC (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA (2022)
Ilan Doron Arad, Ariel Kulik, Hadas Shachnai
An APTAS for Bin Packing with Clique-Graph Conflicts. WADS (2021)
Ariel Kulik, Roy Schwartz, Hadas Shachnai
A refined analysis of submodular Greedy. Oper. Res. Lett. 49 (4) (2021)
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz
General Knapsack Problems in a Dynamic Setting. APPROX-RANDOM (2021)
Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz
General Knapsack Problems in a Dynamic Setting. CoRR (2021)
Ariel Kulik, Hadas Shachnai, Gal Tamir
On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. 296 (2021)
Ariel Kulik, Roy Schwartz, Hadas Shachnai
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR (2021)
Yaron Fairstein, Ariel Kulik, Hadas Shachnai
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA (2021)
Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai
-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR (2020)
Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai
-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA (2020)
Ariel Kulik, Hadas Shachnai
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. FOCS (2020)
Yaron Fairstein, Ariel Kulik, Hadas Shachnai
tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. CoRR (2020)
Ori Rottenstreich, Ariel Kulik, Ananya Joshi, Jennifer Rexford, Gábor Rétvári, Daniel S. Menasché
Cooperative Rule Caching for SDN Switches. CloudNet (2020)
Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA (2019)
Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR (2019)
Ariel Kulik, Hadas Shachnai
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. CoRR (2019)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93 (2018)
Ariel Kulik, Hadas Shachnai, Gal Tamir
On Lagrangian Relaxation and Reoptimization Problems. CoRR (2015)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. 38 (4) (2013)
Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) (2012)
Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Theor. Comput. Sci. 412 (52) (2011)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints CoRR (2011)
Ariel Kulik, Hadas Shachnai
There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. 110 (16) (2010)
Ariel Kulik, Hadas Shachnai, Tami Tamir
Maximizing submodular set functions subject to multiple linear constraints. SODA (2009)
Ariel Kulik, Hadas Shachnai
On Lagrangian Relaxation and Subset Selection Problems. WAOA (2008)