{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4595477","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4595477","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4595477","kernelVersion":"v1","immutable":true,"modified":"2026-01-23T22:44:42Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4595477","name":"Approximation algorithms for dynamic storage allocation","headline":"Approximation algorithms for dynamic storage allocation","description":"scientific article; zbMATH DE number 6815383","url":"https://portal.mardi4nfdi.de/entity/Q4595477","datePublished":"2017-12-05","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1330664"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4595471"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/3-540-61680-2_46","url":"https://doi.org/10.1007/3-540-61680-2_46"},"sameAs":["https://doi.org/10.1007/3-540-61680-2_46"]},"provenance":{"prov:generatedAtTime":"2026-01-23T22:44:42Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}