Search Results - "Kulik, Ariel"

Computing Generalized Convolutions Faster Than Brute Force by Esmer, Barış Can, Kulik, Ariel, Marx, Dániel, Schepper, Philipp, Węgrzycki, Karol

“…In this paper, we consider a general notion of convolution. Let D be a finite domain and let D n be the set of n -length vectors (tuples) of D . Let f : D × D…”
Get full text

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

“…We study the budgeted laminar matroid independent set problem. The input is a ground set, where each element has a cost and a non-negative profit, along with a…”
Get full text

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

“…We study the uniform 2-dimensional vector multiple knapsack (2VMK) problem, a natural variant of multiple knapsack arising in real-world applications such as…”
Get full text

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

“…Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage,…”
Get full text

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations by Kulik, Ariel, Shachnai, Hadas

“…In this paper we introduce randomized branching as a tool for parameterized approximation and develop the mathematical machinery for its analysis. Our…”
Get full text

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

“…Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined…”
Get full text

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

“…We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions…”
Get full text

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

“…In the d-dimensional ( vector) knapsack problem given is a set of items, each having a d-dimensional size vector and a profit, and a d-dimensional bin. The…”
Get full text

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding by Kulik, Ariel, Mnich, Matthias, Shachnai, Hadas

“…We study the d-DIMENSIONAL VECTOR BIN PACKING (d \mathbf{V B P}) problem, a generalization of BIN PACKING with central applications in resource allocation and…”
Get full text

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

“…We study the problem of maximizing a monotone submodular function subject to a Multiple Knapsack constraint. The input is a set I of items, each has a…”
Get full text

Data Plane Cooperative Caching With Dependencies by Rottenstreich, Ori, Kulik, Ariel, Joshi, Ananya, Rexford, Jennifer, Retvari, Gabor, Menasche, Daniel Sadoc

“…Caching is at the core of most modern communication systems, where caches are used to store content and traffic classification rules. While network components…”
Get full text

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems by Esmer, Barış Can, Kulik, Ariel

“…In this paper we introduce Sampling with a Black Box, a generic technique for the design of parameterized approximation algorithms for vertex deletion problems…”
Get full text

Approximation schemes for deal splitting and covering integer programs with multiplicity constraints by Kulik, Ariel, Shachnai, Hadas, Shmueli, Oded, Sayegh, Robert

“…We consider the problem of splitting an order for R goods, R ≥ 1 , among a set of sellers, each having bounded amounts of the goods, so as to minimize the…”
Get full text

Fine Grained Lower Bounds for Multidimensional Knapsack by Doron-Arad, Ilan, Kulik, Ariel, Manurangsi, Pasin

“…We study the $d$-dimensional knapsack problem. We are given a set of items, each with a $d$-dimensional cost vector and a profit, along with a $d$-dimensional…”
Get full text

Unsplittable Flow on a Short Path by Doron-Arad, Ilan, Grandoni, Fabrizio, Kulik, Ariel

“…In the Unsplittable Flow on a Path problem UFP, we are given a path graph with edge capacities and a collection of tasks. Each task is characterized by a…”
Get full text

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“…In [Math. Oper. Res., 2011], Fleischer et al. introduced a powerful technique for solving the generic class of separable assignment problems (SAP), in which a…”
Get full text

Lower Bounds for Matroid Optimization Problems with a Linear Constraint by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“…We study a family of matroid optimization problems with a linear constraint (MOL). In these problems, we seek a subset of elements which optimizes (i.e.,…”
Get full text

Budgeted Matroid Maximization: a Parameterized Viewpoint by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“…We study budgeted variants of well known maximization problems with multiple matroid constraints. Given an $\ell$-matchoid $\cm$ on a ground set $E$, a profit…”
Get full text

Improved Approximation for Two-dimensional Vector Multiple Knapsack by Cohen, Tomer, Kulik, Ariel, Shachnai, Hadas

“…We study the uniform $2$-dimensional vector multiple knapsack (2VMK) problem, a natural variant of multiple knapsack arising in real-world applications such as…”
Get full text

An FPTAS for Budgeted Laminar Matroid Independent Set by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas

“…We study the budgeted laminar matroid independent set problem. The input is a ground set, where each element has a cost and a non-negative profit, along with a…”
Get full text