{ "items" : [
    { "id" : "http://webisa.webdatacommons.org/453852159"
      "properties" : {
        "http://www.w3.org/1999/02/22-rdf-syntax-ns#type" : [ "http://www.w3.org/ns/prov#Entity" ] ,
        "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." ] ,
        "http://www.w3.org/ns/prov#wasQuotedFrom" : [ "researchgate.net" ] } },

    { "id" : "http://webisa.webdatacommons.org/prov/124112063"
      "properties" : {
        "http://www.w3.org/ns/prov#wasDerivedFrom" : [ "http://webisa.webdatacommons.org/453852159"] } } }
