{"entities":{"Q6946863":{"pageid":21184755,"ns":120,"title":"Item:Q6946863","lastrevid":75973725,"modified":"2026-04-22T09:06:42Z","type":"item","id":"Q6946863","labels":{"en":{"language":"en","value":"An \\(O(1)\\)-approximation for minimum spanning tree interdiction"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8076126"}},"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":"Q6946863$C7D65B30-E54B-4182-A047-0BC033F1FC01","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c41017aa35fc4b628b26630b7e815fdfd71a436d","datavalue":{"value":{"text":"An \\(O(1)\\)-approximation for minimum spanning tree interdiction","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6946863$B1898168-927C-4B82-AE5C-4964E4993E69","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ea6718f2aeb7acc44781ec0b2a299c8d5ee35bd2","datavalue":{"value":"10.1109/FOCS.2015.49","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946863$E1117A4A-769A-4E2C-9B12-FA2F163B82A5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"26f62544e3496a6c42798706c99506c8712f0566","datavalue":{"value":{"entity-type":"item","numeric-id":299792,"id":"Q299792"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6946863$324F869F-2339-4295-966F-1087925A6A87","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"edc92756de24fbad63d3f53ad7f8ea4e3721e7de","datavalue":{"value":{"time":"+2025-08-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":"Q6946863$6A614A9B-453E-4052-86E7-81E483F59F7A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946863$F97AE405-8261-4869-9563-DC267796887E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946863$DF6EF4DF-1CDB-444F-88DD-8DDA60DE7BD8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946863$D4BA546B-4624-42B3-8F44-6CD659C639EC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d8481feaef777f5e7e010897f6d89cdca65aec2e","datavalue":{"value":"8076126","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6946863$3C65B1C6-2A02-41A9-A5AC-211214AB27F6","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":"Q6946863$2EA84DC8-087B-4B40-AED6-D9AFCC2C0988","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An \\(O(1)\\)-approximation for minimum spanning tree interdiction","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_%5C(O(1)%5C)-approximation_for_minimum_spanning_tree_interdiction"}}}}}