{"entities":{"Q809604":{"pageid":811452,"ns":120,"title":"Item:Q809604","lastrevid":64539072,"modified":"2026-04-11T20:34:02Z","type":"item","id":"Q809604","labels":{"en":{"language":"en","value":"A highly parallel algorithm, for multistage optimization problems and shortest path problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4213447"}},"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":"Q809604$5F78FE22-5FAE-4222-83DE-E4E9C5B5339B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f5d8da5f0ccc7d2261cc5c248afe7a785c1973fa","datavalue":{"value":{"text":"A highly parallel algorithm, for multistage optimization problems and shortest path problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q809604$5FBADC3B-812D-4E41-9C35-92E685F5BF37","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"203cadb6a62242e32f0497473068ce38d275f2d5","datavalue":{"value":"0733.68036","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809604$C43A0D4E-7682-4077-A5DC-8C75146C3B8E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e5d3e60d430cb35a712656c432c36f5f5ffc8a85","datavalue":{"value":"10.1016/0743-7315(91)90126-T","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809604$3B9772A2-E6B7-4C04-AC71-05A51D873920","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e441edf62f817ab5785922b4a3979da75cae68bd","datavalue":{"value":{"entity-type":"item","numeric-id":809601,"id":"Q809601"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q809604$F636F0F3-1D15-4FE6-9909-ADAD6A11FEC3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3dcbee0aa94868a264e65b36cf2c52b46d1f9b8b","datavalue":{"value":{"entity-type":"item","numeric-id":809602,"id":"Q809602"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q809604$CED1CA63-2781-4E93-90D1-ABE4454017CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8b53b10dcc892daaa94ca98d4713ddfd480e3d35","datavalue":{"value":{"entity-type":"item","numeric-id":1345186,"id":"Q1345186"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q809604$6D1F9230-09A9-4D54-8A8E-E81BE9CE107B","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":"Q809604$EACFDE15-6A1A-40A0-9079-3276CB6B5AE5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"391107ffc7a24346d69c573e292e4ff4587e3aaa","datavalue":{"value":{"time":"+1991-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q809604$9CC23EBE-A408-4683-9456-B5C59D8DF7AE","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f00002e00dfebf2b240e0f2ebfc11fb138a00913","datavalue":{"value":"The authors present a parallel algorithm which solves the multistage optimization problem of n stages. The algorithm based on the recursive application of an aggregation procedure has time complexity O(log n).","type":"string"},"datatype":"string"},"type":"statement","id":"Q809604$30FEE785-130A-4B7B-B94E-C84DB745F18E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b65efe51b183d0f4a672427b8171cd1e14211cba","datavalue":{"value":"68W15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809604$A6859A36-BC0C-4798-BAE0-4D98D7E1F813","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809604$3D28DB87-2A57-455F-A558-8A752A4894DF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ddbe14a36b4f8861d4221ad6ef1dd8e77eb949c3","datavalue":{"value":"4213447","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q809604$4E4304D1-E64C-4A70-BC3B-23B6122D040C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d82cfa81638332a8c825bcbbd9d7f7f9c0c45be","datavalue":{"value":"dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q809604$295366CA-0659-489A-A623-CF64B310585E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7408119b742974ff13b5f31e4034650ba9fb110a","datavalue":{"value":"divide and conquer","type":"string"},"datatype":"string"},"type":"statement","id":"Q809604$3E33EC91-220B-4221-BD4A-FE99EC412EF2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"69d0c99f1e5283b31715a9c7d799852fe62c506e","datavalue":{"value":"shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q809604$EF379532-99A4-4F47-9940-1B575EEFCB67","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":"Q809604$8F345560-0219-44C9-9E07-AD13E78F58F9","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0f7d2bae9077c0302df7f2fb4aa3e19dbc27e4bb","datavalue":{"value":{"entity-type":"item","numeric-id":4005371,"id":"Q4005371"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0106622a07f9ea54965dd8e86acf41588dadcfc1","datavalue":{"value":{"amount":"+0.8256758451461792","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q809604$0E526D0C-019E-4C89-A117-7DC2F84E068B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8f866f45186258db16b75eda82f561376d49742e","datavalue":{"value":{"entity-type":"item","numeric-id":3320152,"id":"Q3320152"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8d10b03bf116beb8e2c713406eb6ce119bc3c0b8","datavalue":{"value":{"amount":"+0.8163173198699951","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q809604$8EC0B4BD-6CEA-46C7-B893-16FCC3458C2D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"677c205d44f8a0aa2511703fe2b32a186c66157e","datavalue":{"value":{"entity-type":"item","numeric-id":1304488,"id":"Q1304488"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d03efd245c97c103c7b3ad0b3cabfebf7480bc7f","datavalue":{"value":{"amount":"+0.8020015954971313","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q809604$7F4DE326-0E66-40AC-B0F7-8A8E5190609E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8d2cee070c9ffd2e1fe9ea286fc27fc45f6ea9a6","datavalue":{"value":{"entity-type":"item","numeric-id":4856321,"id":"Q4856321"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"260f9b3af710ea8a09922583d43c3fb22788ae18","datavalue":{"value":{"amount":"+0.7922133207321167","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q809604$B2430F00-CD8C-43A4-8692-07DE48B13281","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5b21045a04e9840a860694cd6a43313b58d2df4f","datavalue":{"value":{"entity-type":"item","numeric-id":3366282,"id":"Q3366282"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"914e9eb6cc336f0905668ba96afd3cca3a67c3ff","datavalue":{"value":{"amount":"+0.791526734828949","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q809604$8AE65A1F-5022-4F78-A8BA-62C09761594F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A highly parallel algorithm, for multistage optimization problems and shortest path problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_highly_parallel_algorithm,_for_multistage_optimization_problems_and_shortest_path_problems"}}}}}