{"entities":{"Q7255398":{"pageid":24617906,"ns":120,"title":"Item:Q7255398","lastrevid":84858761,"modified":"2026-06-02T14:53:21Z","type":"item","id":"Q7255398","labels":{"en":{"language":"en","value":"Approximation algorithms for allocation problems: improving the factor of \\(1 - 1/e\\)"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8205716"}},"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":"Q7255398$E4B7A57F-9F2A-4209-B147-8761892EFA12","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a726ebec8348cdadd8147312c4fcbd342cef04e0","datavalue":{"value":{"text":"Approximation algorithms for allocation problems: improving the factor of \\(1 - 1/e\\)","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7255398$27BAD4DD-2825-4D47-85A4-067D1FFEDF09","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3a12be767e09b7cdb2e2f05b8ac50ad4d4625851","datavalue":{"value":"10.1109/FOCS.2006.14","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7255398$920C04B0-9022-4487-970F-396D87F6DEF6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4fbe35cb61496fa8363dcdb2d9d3a4d54bbef6e2","datavalue":{"value":{"entity-type":"item","numeric-id":6480586,"id":"Q6480586"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7255398$C49D26C1-CAA0-4A06-8328-CF0B2BEFE879","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1943967be97424db4f446b7aa0ddc85eccafb225","datavalue":{"value":{"entity-type":"item","numeric-id":185367,"id":"Q185367"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7255398$6A34CF3A-B20D-4D47-9867-FD2C682A611B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eed00f8a15e6ee04c7dcccc98e92c47d66129d07","datavalue":{"value":{"time":"+2026-05-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7255398$6F919B5C-210C-4AAB-869A-984FC8302D13","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7255398$F0A65937-D15C-4CD4-BAFD-885AE32359E0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ea67f24386bdc8462522478bb0d510722591cabf","datavalue":{"value":"8205716","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7255398$C1C1D711-009D-4572-8BAC-0457D9C6E737","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":"Q7255398$E4E852E4-5E84-48F1-A1C6-EBF4D5BB3BFF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation algorithms for allocation problems: improving the factor of \\(1 - 1/e\\)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximation_algorithms_for_allocation_problems:_improving_the_factor_of_%5C(1_-_1/e%5C)"}}}}}