{"entities":{"Q1893670":{"pageid":1904412,"ns":120,"title":"Item:Q1893670","lastrevid":71087445,"modified":"2026-04-13T19:23:51Z","type":"item","id":"Q1893670","labels":{"en":{"language":"en","value":"An algorithm for finding the \\(K\\)-best allocations of a tree structured program"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 772221"}},"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":"Q1893670$5589FA39-D9EA-4177-AE52-95313D0887D0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2a5cf9839c054ab798049cc0045bf60b97e904a7","datavalue":{"value":{"text":"An algorithm for finding the \\(K\\)-best allocations of a tree structured program","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1893670$2ABA4E86-B072-4C76-B627-68B531631824","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b082407a691d08da1c1dc448eec3540eeb70cbcb","datavalue":{"value":"0939.68946","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1893670$889BAEE3-9303-4C28-963E-CCA97073F170","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b1f1c6a8167c7f3e97dc242c6c4f58c64741e146","datavalue":{"value":{"entity-type":"item","numeric-id":176416,"id":"Q176416"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1893670$347E70FC-2346-4466-8632-F6D9474CE6B4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4474ef6154a976c7aea3dc265a433065dbf43280","datavalue":{"value":{"entity-type":"item","numeric-id":176417,"id":"Q176417"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1893670$95202F72-671F-4ADA-860C-27FF7C899F99","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b1a1e419db9a491566962c608d7eb540caa9bc60","datavalue":{"value":{"entity-type":"item","numeric-id":86622,"id":"Q86622"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1893670$6ED1D2D8-521F-42FC-9D99-77DE1774A790","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c7e022d0e2e29313a1f42639a485714f8477b23d","datavalue":{"value":{"time":"+1995-07-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1893670$E2FE1F09-FC15-4711-A7CB-F035C0EB8CAD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de3565cfd3393000dd87ca545f95ff84d4c1446","datavalue":{"value":"68W10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1893670$F53426C8-FED8-4D00-82FE-C81F6E287096","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35bbdcbda53152c249a7f99650e19b5ef62999f2","datavalue":{"value":"68Q10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1893670$5BB277B9-FE57-473C-8C2A-F555B866516A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a8b4c1d5df517bb5ebbc1feba1a1b3ffb72b5858","datavalue":{"value":"772221","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1893670$5F57BE27-C888-40D7-ACBD-8F9EFAD96682","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":"Q1893670$2C7B32B8-4278-4815-B1C5-326CA18AD4CB","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"937c0824db6cfd45fc72a91c23d22b4747173e28","datavalue":{"value":"https://doi.org/10.1006/jpdc.1995.1061","type":"string"},"datatype":"url"},"type":"statement","id":"Q1893670$E0CE3E1D-BEA6-4ADE-9766-AB71CDD5D8AD","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"f7387935338184f89430ca552005026f240d1a77","datavalue":{"value":"W2061467656","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1893670$B6637237-1436-4FDE-9DFE-3D5A42A96998","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e47cdb11ef2cb54945b6192e0fa60e36352c3a2f","datavalue":{"value":"10.1006/JPDC.1995.1061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1893670$8F021363-6EF9-4DCB-A374-95992BB6A1EF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for finding the \\(K\\)-best allocations of a tree structured program","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_algorithm_for_finding_the_%5C(K%5C)-best_allocations_of_a_tree_structured_program"}}}}}