Near-tight (2/3-ε) approximation for identical-capacity bottleneck multiple knapsack and (1/2-ε) for arbitrary capacities, with matching inapproximability.
Journal of Scheduling , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
2-Visits is strongly NP-complete for multiplicity 2 but in RP for constant distinct deadlines, with a 0.9142 density lower bound for 2-Visits and thresholds approaching 5/6 for large k.
citing papers explorer
-
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
Near-tight (2/3-ε) approximation for identical-capacity bottleneck multiple knapsack and (1/2-ε) for arbitrary capacities, with matching inapproximability.
-
Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
2-Visits is strongly NP-complete for multiplicity 2 but in RP for constant distinct deadlines, with a 0.9142 density lower bound for 2-Visits and thresholds approaching 5/6 for large k.