The following pages link to Ariel Kulik (Q655415):
Displayed 16 items.
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- An APTAS for bin packing with clique-graph conflicts (Q832868) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- A refined analysis of submodular greedy (Q2060587) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Parameterized Approximation via Fidelity Preserving Transformations (Q2843261) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- (Q4633865) (← links)
- (Q5075815) (← links)
- Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints (Q5169688) (← links)
- A (1-e^{-1}-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem (Q5874514) (← links)
- Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping (Q6075930) (← links)
- General Knapsack Problems in a Dynamic Setting (Q6090887) (← links)
- Computing generalized convolutions faster than brute force (Q6185947) (← links)