{"entities":{"Q6988178":{"pageid":21432078,"ns":120,"title":"Item:Q6988178","lastrevid":76344843,"modified":"2026-04-23T18:14:08Z","type":"item","id":"Q6988178","labels":{"en":{"language":"en","value":"A tight combinatorial algorithm for submodular maximization subject to a matroid constraint"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8036057"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6988178$A5E2299F-833F-450F-8961-E3F265AFACE6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"eef9e34a868f24e1fee9c15073ab2b977a5c20f0","datavalue":{"value":{"text":"A tight combinatorial algorithm for submodular maximization subject to a matroid constraint","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6988178$6B998C1D-A95A-4BEA-8343-E21A3C932F8D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"944054702040caf8acdcfd1b3c3cbfd86e1a1d54","datavalue":{"value":"10.1109/FOCS.2012.55","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6988178$66DDF90E-76B0-472F-8980-52D6C8F8DE4D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c037db836c04e486b607b377f1aa9a38f1c03dbc","datavalue":{"value":{"entity-type":"item","numeric-id":2904747,"id":"Q2904747"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6988178$9F283F21-A669-4D4C-B101-B28A56F5856E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"be0fe0a7fa80a03dbe218a5c976959a59a29e24d","datavalue":{"value":{"entity-type":"item","numeric-id":312256,"id":"Q312256"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6988178$B338A9F7-A5F8-4862-810A-DA5507E82900","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f69289e73108950a31d5c996a2acba18c93b2ef6","datavalue":{"value":{"time":"+2025-05-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6988178$4540874F-9CD6-4947-8445-1E2B5065E361","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6988178$1D972AD5-A752-4106-9C14-76D95A2C270C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"57f167c32409cd84dad7e725a6344d78daf6bdb3","datavalue":{"value":"05-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6988178$0C6B0463-2D35-4B6B-8ABA-CFB56C789A4A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6988178$CCA3CEE9-F974-4B5D-AE81-23871EF12BF4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"bf1c1dacc2e1c64b00eb8c72556a27baac8cd166","datavalue":{"value":"8036057","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6988178$F959C1EB-A086-4249-A453-B97FECC76703","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6988178$F73756C7-C6CA-4C66-B626-C9BF3AD163BA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A tight combinatorial algorithm for submodular maximization subject to a matroid constraint","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_tight_combinatorial_algorithm_for_submodular_maximization_subject_to_a_matroid_constraint"}}}}}