Conceptio › Archive › arXiv (OAI Expanded)
arXiv (OAI Expanded)open access

Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Bicriteria Optimality in 2D

Bringmann, Karl et al.
arXiv (OAI Expanded) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
data-structures-and-algorithms
data structures and algorithms
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 779530
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.