{"entities":{"Q2816044":{"pageid":2826782,"ns":120,"title":"Item:Q2816044","lastrevid":79574861,"modified":"2026-05-06T14:14:23Z","type":"item","id":"Q2816044","labels":{"en":{"language":"en","value":"A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6600232"}},"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":"Q2816044$590ABD66-FA56-481B-911D-F43838689133","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"38ba4bc6d815fb682a4f4a08965ff27c7628d908","datavalue":{"value":"1412.05039","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816044$DB80DCA7-9184-4E18-91BE-AE1C9746FB5D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"229745c739398706b499dd2ab4ef9fd94f7cbced","datavalue":{"value":{"time":"+2016-07-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2816044$4C87AAA9-7D55-4025-8D63-4310014D7527","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"035849103eeed8baef9699d133cca9a00d59a73e","datavalue":{"value":"http://www.sciencedirect.com/science/article/pii/S1571065305800927?np=y","type":"string"},"datatype":"url"},"type":"statement","id":"Q2816044$48418572-DB5D-4D07-99B9-65B0CC453A91","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816044$B5BA8F3C-8412-4869-91BB-ABA83BE674BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816044$F5E80437-2D87-43D6-BB32-35563BE712C7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"749b7137f279a66a306e75e15f613231b281c1c5","datavalue":{"value":"05C85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816044$EE0E429B-5A7F-4C46-B4F3-23994ECF2FF4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"8115567f1cb97b8ac4390b2d069f17e8be397e01","datavalue":{"value":"6600232","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2816044$FEBC5489-BBCA-4675-B66E-2E5FC01FD27E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"66a0382610d9d9e28ef95c946357abf690b72349","datavalue":{"value":"Steiner tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q2816044$77A82956-E942-4CBA-B1B3-5152D98B5B4B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"732e1592c53acfd9740f2cb8680bbb91fda5b0af","datavalue":{"value":"minimum spanning tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q2816044$B9A74BB9-8EC1-443C-918F-00C487765C00","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d82cfa81638332a8c825bcbbd9d7f7f9c0c45be","datavalue":{"value":"dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2816044$F7CFDF47-E576-4DAF-96EF-5BD39803F9CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"aadabe966e2305ba71424e66813371b8e5eccbd4","datavalue":{"value":"Prim heuristic","type":"string"},"datatype":"string"},"type":"statement","id":"Q2816044$ABE7A9D8-C5BD-4EDF-BD19-286167695FF1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b6fb9ac68bddbfa8d11616ed9b4850fa8757e1bd","datavalue":{"value":"heuristic algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q2816044$C3591459-57FA-474C-88D3-844023D8A9B6","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":"Q2816044$810F688B-442A-4C01-BB8F-4E9650B82C9C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"53889acc469d65fc00c48fc9e722a4d407390e77","datavalue":{"value":{"entity-type":"item","numeric-id":6489177,"id":"Q6489177"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2816044$C4AB2917-D56E-4C2F-B6F0-E40B6D187DA6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7e8aea0db2b8d5602e5425a18af58358b1601543","datavalue":{"value":{"entity-type":"item","numeric-id":3635576,"id":"Q3635576"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2816044$DBFF9245-A659-4146-AD55-E0CC06D2B424","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4a8bfc311bd2568f9db11b66a3b9aa859d8b4d9b","datavalue":{"value":{"text":"A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2816044$08BF5F8E-C06E-4067-9454-89087E45C58C","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"81f630f60f3182b6fae88791ab29fe63f7c524e8","datavalue":{"value":{"entity-type":"item","numeric-id":3816989,"id":"Q3816989"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"784a55238145253e112745d8e8905d35eb1718c1","datavalue":{"value":{"amount":"+0.773995041847229","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":"Q2816044$0EEB0432-9DC8-4EB2-95AD-0DAA1632799E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"dc0faa2166fb6e8cc53b8affc6042f2b5473e755","datavalue":{"value":{"entity-type":"item","numeric-id":3985984,"id":"Q3985984"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"723ecbad6dbf7d1afc45c8a8f8c9c5e6871232ee","datavalue":{"value":{"amount":"+0.7729717493057251","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":"Q2816044$26AC9BD3-2435-4F8D-A973-B6A9561BC3C1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"56cdd0dc07e7dbb088aecf79d2a6b024295d382a","datavalue":{"value":{"entity-type":"item","numeric-id":1315998,"id":"Q1315998"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8d62651abae62cfba4e015a1d4de1574d020ad97","datavalue":{"value":{"amount":"+0.7685468792915344","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":"Q2816044$9B130100-14C0-4538-91DC-819C0748F678","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7069f3aa20d0f38b93115edd43b3d937722187aa","datavalue":{"value":{"entity-type":"item","numeric-id":5943667,"id":"Q5943667"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e003bbcc508ba5535c9cd342b5c6b4de51ccabae","datavalue":{"value":{"amount":"+0.7683914303779602","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":"Q2816044$10C7D6FC-B769-401F-901E-BB6FE519825A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ca556cd39f2bcc60e44400c2b2b2a9e58a69f95e","datavalue":{"value":{"entity-type":"item","numeric-id":4014197,"id":"Q4014197"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dfae24199522603212eafc1078bacedfc9cc8fc4","datavalue":{"value":{"amount":"+0.7624688148498535","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":"Q2816044$C15CFE6E-FB2B-49F9-8095-07AC3B59B4CD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Prim-based_heuristic_algorithm_for_obstacle_avoiding_rectilinear_Steiner_minimal_tree"}}}}}