E-LIB Suche - Ergebnisse für: Kulik, Ariel

1

Improved Approximation for Two-dimensional Vector Multiple ..:

Cohen, Tomer ; Kulik, Ariel ; Shachnai, Hadas
Computational Geometry. , 2024

Link: https://doi.org/10.1016/..

2

Computing Generalized Convolutions Faster Than Brute Force:

Esmer, Barış Can ; Kulik, Ariel ; Marx, Dániel..
Algorithmica. 86 (2023) 1 - p. 334-366 , 2023

Link: https://doi.org/10.1007/..

3

An FPTAS for budgeted laminar matroid independent set:

Doron-Arad, Ilan ; Kulik, Ariel ; Shachnai, Hadas
Operations Research Letters. 51 (2023) 6 - p. 632-637 , 2023

Link: https://doi.org/10.1016/..

4

Improved Approximations for Vector Bin Packing via Iterativ..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Kulik, Ariel ; Mnich, Matthias ; Shachnai, Hadas - p. 1366-1376 , 2023

Link: https://doi.org/10.1109/..

5

An almost optimal approximation algorithm for monotone subm..:

Fairstein, Yaron ; Kulik, Ariel ; Naor, Joseph (Seffi)..
Journal of Computer and System Sciences. 125 (2022) - p. 149-165 , 2022

Link: https://doi.org/10.1016/..

6

A refined analysis of submodular Greedy:

Kulik, Ariel ; Schwartz, Roy ; Shachnai, Hadas
Operations Research Letters. 49 (2021) 4 - p. 507-514 , 2021

Link: https://doi.org/10.1016/..

7

On Lagrangian relaxation for constrained maximization and r..:

Kulik, Ariel ; Shachnai, Hadas ; Tamir, Gal
Discrete Applied Mathematics. 296 (2021) - p. 164-178 , 2021

Link: https://doi.org/10.1016/..

8

An APTAS for Bin Packing with Clique-Graph Conflicts:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,

Doron-Arad, Ilan ; Kulik, Ariel ; Shachnai, Hadas - p. 286-299 , 2021

Link: https://doi.org/10.1007/..

9

Cooperative Rule Caching for SDN Switches:

, In: 2020 IEEE 9th International Conference on Cloud Networking (CloudNet),

Rottenstreich, Ori ; Kulik, Ariel ; Joshi, Ananya... - p. 1-7 , 2020

Link: https://doi.org/10.1109/..

10

Analysis of Two-variable Recurrence Relations with Applicat..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),

Kulik, Ariel ; Shachnai, Hadas - p. 762-773 , 2020

Link: https://doi.org/10.1109/..

11

Parameterized approximation via fidelity preserving transfo..:

Fellows, Michael R. ; Kulik, Ariel ; Rosamond, Frances.
Journal of Computer and System Sciences. 93 (2018) - p. 30-40 , 2018

Link: https://doi.org/10.1016/..

12

Approximations for Monotone and Nonmonotone Submodular Maxi..:

Kulik, Ariel ; Shachnai, Hadas ; Tamir, Tami
Mathematics of Operations Research. 38 (2013) 4 - p. 729-739 , 2013

Link: http://www.jstor.org/sta..

13

Approximation schemes for deal splitting and covering integ..:

Kulik, Ariel ; Shachnai, Hadas ; Shmueli, Oded.
Theoretical Computer Science. 412 (2011) 52 - p. 7087-7098 , 2011

Link: https://doi.org/10.1016/..

14

There is no EPTAS for two-dimensional knapsack:

Kulik, Ariel ; Shachnai, Hadas
Information Processing Letters. 110 (2010) 16 - p. 707-710 , 2010

Link: https://doi.org/10.1016/..

15

Maximizing submodular set functions subject to multiple lin..:

, In: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms,

Kulik, Ariel ; Shachnai, Hadas ; Tamir, Tami - p. 545-554 , 2009

Link: https://dl.acm.org/doi/1..