arXiv (All)open access
A tight 1/3-approximation algorithm and fully polynomial-time approximation schemes for the Colored Knapsack Problem
data structures and algorithms, optimization and control
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1011438
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.