| http://www.w3.org/ns/prov#value | - In the latter case, the problem is a generalization of the bin-packing problem even when , and thus it is not approximable under 1.5, unless P=NP. We design a polynomial-time approximation scheme (PTAS) for the splittable case when is a fixed constant and is an metric.
|
