Pages that link to "Item:Q765522"
From MaRDI portal
The following pages link to There is no EPTAS for two-dimensional knapsack (Q765522):
Displaying 17 items.
- Approximate composable truthful mechanism design (Q344791) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- A randomized heuristic repair for the multidimensional knapsack problem (Q828650) (← links)
- On the optimality of exact and approximation algorithms for scheduling problems (Q1635503) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Network pollution games (Q1755784) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns (Q2351163) (← links)
- Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Knapsack problems: a parameterized point of view (Q2419116) (← links)
- Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem (Q3196401) (← links)
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
- Bounding the Running Time of Algorithms for Scheduling and Packing Problems (Q5890508) (← links)
- Improved approximation for two-dimensional vector multiple knapsack (Q6639376) (← links)
