( en | de | ru )

 

Disambiguation of "Kulik, Ariel"

Author of the publication

copydeleteadd this publication to your clipboard
There is no EPTAS for two-dimensional knapsack.

, and . Inf. Process. Lett., 110 (16): 707-710 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Eliahu Ariely

Andreas Kulik

Christian Kulik

Ariel Quiñones

Emanuele Arielli

 

Other publications of authors with the same name

Generalized Assignment via Submodular Optimization with Reserved Capacity., , , and . ESA, volume 144 of LIPIcs, page 69:1-69:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Maximizing submodular set functions subject to multiple linear constraints., , and . SODA, page 545-554. SIAM, (2009)Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search., , , , and . ESA, volume 244 of LIPIcs, page 50:1-50:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximate Monotone Local Search for Weighted Problems., , , , and . IPEC, volume 285 of LIPIcs, page 17:1-17:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints., , and . Math. Oper. Res., 38 (4): 729-739 (2013)Cooperative Rule Caching for SDN Switches., , , , , and . CloudNet, page 1-7. IEEE, (2020)Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations., and . FOCS, page 762-773. IEEE, (2020)A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem., , , , and . ESA, volume 173 of LIPIcs, page 44:1-44:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations., , , , and . SODA, page 314-345. SIAM, (2024)General Knapsack Problems in a Dynamic Setting., , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)