Approximate \#knapsack computations to count semi-fair allocations

DOI10.1007/978-3-030-59267-7_21OpenAlexW3110109124MaRDI QIDQ2110714

Theofilos Triommatis, Aris Pagourtzis

Publication date: 22 December 2022

Full work available at URL: https://arxiv.org/abs/1912.12430

zbMATH Keywords

FPTASknapsack problemscounting problemsenvy-freenessfair allocations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Approximate \#knapsack computations to count semi-fair allocations