1 problem

0 votes0 replies1 view
The polynomial-kernel inapproximability conjecture for dynamic vector bin packing
DVBP kernel conjecture. DVBP has no $alpha$ -approximate problem kernels of size polynomial in $mc+numflavors$ , for any $alpha<600/599$ .
Conjectureopenkernelization parameterized-complexity vector-bin-packingarXiv posted 2 days ago

The polynomial-kernel inapproximability conjecture for dynamic vector bin packing