{"@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/Q547862","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q547862","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q547862","kernelVersion":"v1","immutable":true,"modified":"2025-07-03T14:42:30Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q547862","name":"On randomizing two derandomized greedy algorithms","headline":"On randomizing two derandomized greedy algorithms","description":"scientific article; zbMATH DE number 5913528","url":"https://portal.mardi4nfdi.de/entity/Q547862","datePublished":"2011-06-27","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q547861"},{"@id":"https://portal.mardi4nfdi.de/entity/Q313428"},{"@id":"https://portal.mardi4nfdi.de/entity/Q247100"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q247199"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.4310/JOC.2010.V1.N3.A1","url":"https://doi.org/10.4310/JOC.2010.V1.N3.A1"},"sameAs":["https://doi.org/10.4310/JOC.2010.V1.N3.A1"]},"provenance":{"prov:generatedAtTime":"2025-07-03T14:42:30Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}