{"entities":{"Q6864006":{"pageid":20680651,"ns":120,"title":"Item:Q6864006","lastrevid":75184528,"modified":"2026-04-18T03:27:46Z","type":"item","id":"Q6864006","labels":{"en":{"language":"en","value":"Approximation algorithm for fair stochastic maximum coverage problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8154790"}},"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":"Q6864006$5F59F8B3-CE11-47C4-BF29-E84097D06DF1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a473f2f5441517ee514ff64d55df2e7554a6fd74","datavalue":{"value":{"text":"Approximation algorithm for fair stochastic maximum coverage problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6864006$0510AECD-4933-4106-809A-C8C3FEE48566","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3097f4572ffb95aa62f6d203a0b8f21d28f7c7e1","datavalue":{"value":"10.1016/J.TCS.2025.115722","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6864006$6B3DAADB-14FB-4A22-8044-7EB9CE71B4AB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a32bfea74b4d3ec7714cd83f60bcb715fa045bde","datavalue":{"value":{"entity-type":"item","numeric-id":6646738,"id":"Q6646738"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6864006$B9C80460-BAA4-44BC-A145-6C1641FB36E0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"749db56ed30793be45710afd38c1d1914e89240e","datavalue":{"value":{"entity-type":"item","numeric-id":247824,"id":"Q247824"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6864006$9CC53182-B938-4E41-8804-B56146E0A173","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f3c424cd94a60f9664f9fb69cc6027e75cc7ff3f","datavalue":{"value":{"entity-type":"item","numeric-id":123643,"id":"Q123643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6864006$9C61EE94-2CFC-4344-8BBE-E1CD3DFEAB01","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5eb7c5cda49e010c65abc7807dc1347de80276b0","datavalue":{"value":{"time":"+2026-02-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6864006$9FC5D752-68CB-4A1A-A2E0-5000784EEFAF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6864006$40E9F283-7A5C-41BF-97F0-676140407C7A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6864006$6FAA9C78-0296-492F-8369-73B5123C8341","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"dade3bc82a2f7e555fdd92f6a7aa24c002fcafaf","datavalue":{"value":"90C15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6864006$11FC0F0B-86C9-4C90-B4BE-47CCF7C1A1AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6864006$7C3D8B6D-8C1A-491C-AA3E-15963B49210F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e55ecb95f167128d06954f9a4e8adf883723c2ea","datavalue":{"value":"8154790","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6864006$4B64D4B4-7004-48CE-8CD9-56BB06FA176D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4686044a884385bdfad2a80ddeb0f35eb7eb1d21","datavalue":{"value":"stochastic coverage","type":"string"},"datatype":"string"},"type":"statement","id":"Q6864006$11CBBE16-1C06-4D7C-9257-CC1373C1D6F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ea65795de762ded640b7cb44fd9c34fd61f5e27f","datavalue":{"value":"maximum coverage","type":"string"},"datatype":"string"},"type":"statement","id":"Q6864006$09271D74-14B6-4283-A21D-6EBFB832AE49","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c3a8212036bcb9976cc84b155f72fa84de7a937","datavalue":{"value":"fairness constraint","type":"string"},"datatype":"string"},"type":"statement","id":"Q6864006$915B09AE-58A1-4714-A10B-19C9692E7476","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6864006$C5060280-88D2-41C6-9C59-012E42048BB5","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":"Q6864006$4FD49646-5D81-46C6-88E2-A4915552DDB6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation algorithm for fair stochastic maximum coverage problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximation_algorithm_for_fair_stochastic_maximum_coverage_problem"}}}}}