{"@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/Q2118859","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2118859","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2118859","kernelVersion":"v1","immutable":true,"modified":"2026-02-17T15:39:34Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2118859","name":"Approximation by lexicographically maximal solutions in matching and matroid intersection problems","headline":"Approximation by lexicographically maximal solutions in matching and matroid intersection problems","description":"scientific article; zbMATH DE number 7496376","url":"https://portal.mardi4nfdi.de/entity/Q2118859","datePublished":"2022-03-23","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q414632"},{"@id":"https://portal.mardi4nfdi.de/entity/Q298983"},{"@id":"https://portal.mardi4nfdi.de/entity/Q284711"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1986954"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q123643"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.TCS.2022.01.035","url":"https://doi.org/10.1016/J.TCS.2022.01.035"},"sameAs":["https://doi.org/10.1016/J.TCS.2022.01.035"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2944532"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2465632"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5403864"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2316615"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1854113"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4077061"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4119222"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4174528"}]},"provenance":{"prov:generatedAtTime":"2026-02-17T15:39:34Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}