{"@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/Q2301546","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2301546","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2301546","kernelVersion":"v1","immutable":true,"modified":"2026-02-17T14:42:52Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2301546","name":"Approximating minimum dominating set on string graphs","headline":"Approximating minimum dominating set on string graphs","description":"scientific article; zbMATH DE number 7173303","url":"https://portal.mardi4nfdi.de/entity/Q2301546","datePublished":"2020-02-24","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q778516"},{"@id":"https://portal.mardi4nfdi.de/entity/Q299088"},{"@id":"https://portal.mardi4nfdi.de/entity/Q388102"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1007/978-3-030-30786-8_18","url":"https://doi.org/10.1007/978-3-030-30786-8_18"},"sameAs":["https://doi.org/10.1007/978-3-030-30786-8_18"]},"provenance":{"prov:generatedAtTime":"2026-02-17T14:42:52Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}