{"@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/Q896121","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q896121","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q896121","kernelVersion":"v1","immutable":true,"modified":"2025-07-10T10:00:33Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q896121","name":"Improved algorithms for computing minmax regret sinks on dynamic path and tree networks","headline":"Improved algorithms for computing minmax regret sinks on dynamic path and tree networks","description":"scientific article; zbMATH DE number 6520518","url":"https://portal.mardi4nfdi.de/entity/Q896121","datePublished":"2015-12-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q284587"},{"@id":"https://portal.mardi4nfdi.de/entity/Q175380"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q123643"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.TCS.2015.07.009","url":"https://doi.org/10.1016/J.TCS.2015.07.009"},"sameAs":["https://doi.org/10.1016/J.TCS.2015.07.009"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1569932"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5431308"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2942389"},{"@id":"https://portal.mardi4nfdi.de/entity/Q486974"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4922120"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2776597"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5746252"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1353370"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5251631"},{"@id":"https://portal.mardi4nfdi.de/entity/Q860399"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2564302"},{"@id":"https://portal.mardi4nfdi.de/entity/Q297369"},{"@id":"https://portal.mardi4nfdi.de/entity/Q477612"}]},"provenance":{"prov:generatedAtTime":"2025-07-10T10:00:33Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}