Inclusion-wise extremal knapsack problems are (mostly) hard to approximate EBSQEQYECS

URI	`m2://res/EBSQEQYECS`
Kind	preprint
Creators	Fabio Ciccarelli, Fabio Furini, Ulrich Pferschy, Elena Rener
Date	2026-10-13
Subjects	arxiv cs.DS, arxiv math.OC
Scope	border

Expressions

Date	2026-10-13
Ids	arXiv 2610.18017

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Exact filling	statement	corollary 1	arxiv
3NA53AY24N	statement	theorem 0.5	arxiv
609A2F13RF	statement	theorem 0.4	arxiv
Complementarity	statement	proposition 1	arxiv
ADFXWFTYZA	statement	theorem 0.2	arxiv
AGJET52HHQ	example	example 2	arxiv
Minimal cover, \MPMKC	definition	definition 2	arxiv
B59HF66TPB	statement	corollary 2	arxiv
BHM4E8QDXH	statement	theorem 0.1	arxiv
BY6JMXNXNN	statement	theorem 0.9	arxiv
C84ANY8CZA	statement	corollary 3	arxiv
DS7SAB56T2	statement	theorem 0.10	arxiv
Gap lemma	statement	lemma 3	arxiv
EKS06V9CEX	statement	proposition 2	arxiv
HRWRA8XH9T	example	example 4	arxiv
HWSXWBQAHH	statement	theorem 0.6	arxiv
KDQ21MQT6G	statement	theorem 0.3	arxiv
N3AX9CHP7W	statement	corollary 4	arxiv
NRJYY6ZPF4	statement	theorem 0.7	arxiv
P1C63KQTTX	statement	lemma 4	arxiv
Maximal packing, \MCMKP	definition	definition 1	arxiv
R5KMS5E0PE	statement	proposition 3	arxiv
TN0KD2GBS8	example	example 1	arxiv
V2B6W3JTFJ	statement	theorem 0.8	arxiv
VKEZ4TJPT9	problem	problem	arxiv
Maximality is decided by the smallest excluded item	statement	lemma 1	arxiv
Minimality is decided by the smallest selected item	statement	lemma 2	arxiv
ZZRW0PS1J6	example	example 3	arxiv