{"entities":{"Q2817634":{"pageid":2828372,"ns":120,"title":"Item:Q2817634","lastrevid":83356238,"modified":"2026-05-07T07:20:00Z","type":"item","id":"Q2817634","labels":{"en":{"language":"en","value":"An \\(O(\\log k)\\) approximation algorithm for the \\(k\\) minimum spanning tree problem in the plane"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6621814"}},"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":"Q2817634$E6BB4A7F-A131-4512-AEDE-7A73067CD4CA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"899b8f200662c35759005b9a614fdb284daf7d20","datavalue":{"value":"1344.68285","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$A074A2F7-778A-4447-965F-DB4471696E0F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ba0e1b49c76d4e4eb36cc7c6c91ec5a06de33709","datavalue":{"value":"10.1145/195058.195218","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$5A13E944-CB09-4F89-94A2-25C274FEC818","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"47ef01db1ed7a4145ae0163943d2acd493de7572","datavalue":{"value":{"entity-type":"item","numeric-id":293208,"id":"Q293208"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2817634$4BE6EA53-8F34-42E9-A349-44D04144DAD9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5b969806e15667b8bb837290cff38032bdae579d","datavalue":{"value":{"entity-type":"item","numeric-id":242829,"id":"Q242829"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2817634$0E6ACBC6-4719-4E37-B883-D41B69B83C23","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"5ac9865fce36b00b83ba5b8e31f5c41be4684294","datavalue":{"value":{"entity-type":"item","numeric-id":2817591,"id":"Q2817591"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2817634$E5E40C76-5C08-4391-80F1-B1C7CE04EC04","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4cb1dfb644827a2862c7d97faa24a24e858feb59","datavalue":{"value":{"time":"+2016-09-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":"Q2817634$1136F344-4251-4032-9393-939D8215DA57","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$16E69216-3F4D-416F-AEB7-DCEB53D7406F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$78A77950-19F1-4EE0-B925-29344CD3C8D3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$C6F58535-93A9-434C-BE66-00EA974663F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$7FA84546-4061-4730-8509-1D92AA750A51","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"02e4bb612b5bddd0248e332853eb419feb448877","datavalue":{"value":"6621814","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$62E33CC2-E477-4C51-BF0E-784D618C7A5B","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":"Q2817634$CBB332DA-2A89-43DD-8D29-DFA7781A9B3C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"dc970ecc648970fdfce23e09af4c9e2e2f6d6c75","datavalue":{"value":"https://doi.org/10.1145/195058.195218","type":"string"},"datatype":"url"},"type":"statement","id":"Q2817634$61BA516D-5935-40BD-A943-B1439BDED3AC","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3bda6168e83fabc60cc3a3ac4356f4a14950a490","datavalue":{"value":"W2032389500","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2817634$C10FC5CC-D8CF-4F8B-8F21-6EE93BC7583D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"24d252c7f86c75cc43a300e6c8a14fa5aa415673","datavalue":{"value":{"text":"An \\(O(\\log k)\\) approximation algorithm for the \\(k\\) minimum spanning tree problem in the plane","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2817634$0F9FBEA9-E2AC-4716-9088-AC9EC08C280F","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a83c5ece18d4748ba48c16c9cab2111a3755c44a","datavalue":{"value":{"entity-type":"item","numeric-id":679454,"id":"Q679454"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a59ee6cb09ab90ba61a4ed1bb28b98fe07839e25","datavalue":{"value":{"amount":"+0.911676287651062","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":"Q2817634$51D28D4E-A23A-493E-8DFD-02C4BC65E07D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f8629e6e3351e7841888bc00cb40bccdc3440cab","datavalue":{"value":{"entity-type":"item","numeric-id":4234076,"id":"Q4234076"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"143c8caab747f157ef08635524273701f9550e90","datavalue":{"value":{"amount":"+0.8683760762214661","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":"Q2817634$1B13B08A-8917-40C7-8A65-9956966F29E5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8222ceb38be41b3c2e6f8a54668ec346bf6b41e9","datavalue":{"value":{"entity-type":"item","numeric-id":4952696,"id":"Q4952696"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"143c8caab747f157ef08635524273701f9550e90","datavalue":{"value":{"amount":"+0.8683760762214661","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":"Q2817634$45E109A7-CE4F-4DC7-AB05-ED6CB990DDF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7dec635fe28d8e963269e691cb8d0e14558926be","datavalue":{"value":{"entity-type":"item","numeric-id":3128917,"id":"Q3128917"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8f0b2502322764802decc3f2141ee3f883f540e1","datavalue":{"value":{"amount":"+0.8408628702163696","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":"Q2817634$063AF676-88A3-43BA-9EED-E53F261A3BFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a36b4aae383402c083b7c42e45fef9098100f348","datavalue":{"value":{"entity-type":"item","numeric-id":2492706,"id":"Q2492706"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b1e3b4c24c1d798479043e9dc5af02708959756b","datavalue":{"value":{"amount":"+0.8408623933792114","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":"Q2817634$DEDF217B-6410-4F00-B2E2-0EFF9B1EB968","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An \\(O(\\log k)\\) approximation algorithm for the \\(k\\) minimum spanning tree problem in the plane","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_%5C(O(%5Clog_k)%5C)_approximation_algorithm_for_the_%5C(k%5C)_minimum_spanning_tree_problem_in_the_plane"}}}}}