{"entities":{"Q5088993":{"pageid":7118569,"ns":120,"title":"Item:Q5088993","lastrevid":91338485,"modified":"2026-06-04T22:55:04Z","type":"item","id":"Q5088993","labels":{"en":{"language":"en","value":"Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7559260"}},"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":"Q5088993$8F718519-F8B0-4287-B8A7-B8EB73BC2095","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6793430fc5b4ace9180691774574e339423361ba","datavalue":{"value":{"time":"+2022-07-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5088993$6A467D50-EA83-47AD-8B50-81B8F4EE0124","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"159426a5937e62cfbbcc198dd4848ab52d6e715e","datavalue":{"value":"68U05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5088993$033254AC-09A3-42CA-AC77-3EA40CD6349E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3f5bbc30e6e10b759f79a9af6291b4e0b119afb7","datavalue":{"value":"7559260","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5088993$8E001F5C-4C01-4DB0-B3F6-5E266C2A9C32","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"37b2763a57208c334f525d2a83bf6ecda0c1914d","datavalue":{"value":"single-source shortest paths","type":"string"},"datatype":"string"},"type":"statement","id":"Q5088993$9A78094A-B754-49D8-93F6-F3FC317C9D62","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"61868ca11ee7bb59e0b13ef69320929ad5e70591","datavalue":{"value":"weighted unit-disk graphs","type":"string"},"datatype":"string"},"type":"statement","id":"Q5088993$27639DE4-E335-4B62-8A5E-5DD2131F6A84","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"95c041132780a70641bd5fb089e328f28f05b1bb","datavalue":{"value":"geometric graph algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q5088993$467935C2-0F60-4272-8968-3954BFE504DA","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":"Q5088993$D6F28B0B-98A2-4702-BD87-D9FD1E546153","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"3b7ec1e64faa28ff7142d9326d8b09ef039f5d48","datavalue":{"value":{"entity-type":"item","numeric-id":1256856,"id":"Q1256856"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$7ECC1C80-A9FF-4A40-B4F0-43548A7CD4C3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b16281a9e625104bdc9e2cc7b8977d2f9d3b12ad","datavalue":{"value":{"entity-type":"item","numeric-id":2344058,"id":"Q2344058"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$146A3B38-BDC3-4C96-94A2-7DF738487D57","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"77f8ac904f962dc51e204c64053c891913cd4c55","datavalue":{"value":{"entity-type":"item","numeric-id":4636506,"id":"Q4636506"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$A76E8578-8D11-400A-8AF7-A6F3EAFA2461","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"23938e2b4b5812a1bf4200918c88cf942e392ff5","datavalue":{"value":{"entity-type":"item","numeric-id":2405288,"id":"Q2405288"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$A5B51137-7D81-46B9-ADA1-21A52E443A0D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1ba90cb0329eb4407d0c803bc17a437a714021a7","datavalue":{"value":{"entity-type":"item","numeric-id":5115792,"id":"Q5115792"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$C3A1CC52-0A94-44C9-9BCA-06DA5B086640","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f380170dd9de5e69fb40eb46470ac085e19dc87a","datavalue":{"value":{"entity-type":"item","numeric-id":1174134,"id":"Q1174134"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$63F82388-015A-457D-8D0D-8D6740D87D48","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"829783323f4ed61ae4ff3c06344abef0c5d8ed92","datavalue":{"value":{"entity-type":"item","numeric-id":4598137,"id":"Q4598137"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$EF646B14-7AD1-4490-B229-AFDEDCA5D54E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"99114b1bd38a031039ee6a9bed0217048b0b5658","datavalue":{"value":{"entity-type":"item","numeric-id":1101224,"id":"Q1101224"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$EF001B3B-F4CF-4235-9014-40A122E7B26F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ce32b21240a7bd20d2146ec2593083c80a378057","datavalue":{"value":{"entity-type":"item","numeric-id":5700574,"id":"Q5700574"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$8E77DBC7-B0EC-4CE5-A0A5-5B3AA73EEE42","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1719c6e224306a0803210a3400cc194551b34a0a","datavalue":{"value":{"entity-type":"item","numeric-id":4575914,"id":"Q4575914"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$85FDC94E-EECB-443E-83DC-07BEEE6E64F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"880e822fa50e21657d9bdea9e9b17b630cc1c36e","datavalue":{"value":{"entity-type":"item","numeric-id":4504025,"id":"Q4504025"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$009F2D77-4EC2-47CA-8C0B-216771F64BBA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"10e86cee9087dfa59cb062968d8a2c9a2ec42fb5","datavalue":{"value":{"entity-type":"item","numeric-id":633848,"id":"Q633848"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5088993$3D1C8F37-5B67-444C-9555-FA0D2D8F961D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7fbc3675d9959b381f93bd66c0f4c40b52ff7ace","datavalue":{"value":"https://doi.org/10.4230/LIPIcs.SoCG.2019.60","type":"string"},"datatype":"url"},"type":"statement","id":"Q5088993$277DA79D-044C-45BA-89F9-F3E9016422AD","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"5bd305b4e6bffc3f6271e56a6b640f20a7abec73","datavalue":{"value":"W2922095319","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5088993$B0334AC6-5B56-4743-9372-93438D55997A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"ffd5df01997d82cc36c1abb64feb030ac7e1b738","datavalue":{"value":{"text":"Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5088993$9637AEBA-A9B9-4A2E-9248-FE0DFA04E63C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"c9a2f0ec10000931d7e0c73ddf92cb4b40565b9c","datavalue":{"value":"10.4230/LIPICS.SOCG.2019.60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5088993$B4658C73-96F8-4BCD-BF21-D651B6DE9F31","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cb7160e683696f43aa4b1709b5a1ea3318705b06","datavalue":{"value":{"entity-type":"item","numeric-id":2223616,"id":"Q2223616"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"dc2c4bc6a51fba15132b00c73a485e25978b20c2","datavalue":{"value":{"amount":"+0.9979854822158812","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":"Q5088993$36F31074-A6A8-41B5-9783-FC900718B35F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f08bda75bf48976001787d1c191c2da114ebe0d9","datavalue":{"value":{"entity-type":"item","numeric-id":5115792,"id":"Q5115792"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5db43cd5789fc4669d3fd42b675d7ea6226c9999","datavalue":{"value":{"amount":"+0.8853074312210083","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":"Q5088993$2587D68F-7601-4F1C-97A9-53CE3AECBD83","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2db909cff4c17980d3504516f663830fcbaf2a5b","datavalue":{"value":{"entity-type":"item","numeric-id":4626308,"id":"Q4626308"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5127eacc34e1c023dea6efdf0d9e49d18b5c0f46","datavalue":{"value":{"amount":"+0.8830022811889648","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":"Q5088993$E1F1D3E5-DA57-4DD9-8308-6B7204EA656B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1b6d6256f6e678aa49d9ddd11765cdcb500fbdde","datavalue":{"value":{"entity-type":"item","numeric-id":4636506,"id":"Q4636506"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3409bc1ff1b6fe621dedc74e0a5c8d2b55f39ff1","datavalue":{"value":{"amount":"+0.8627045154571533","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":"Q5088993$0EFD10EF-FAD7-46E9-96D7-93B5C6725444","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8632b3326dac2f40a9f520e600850bca717e03ee","datavalue":{"value":{"entity-type":"item","numeric-id":2344058,"id":"Q2344058"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b01630d9ae2ad91db2641c75682884403ea38321","datavalue":{"value":{"amount":"+0.8581345677375793","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":"Q5088993$C87A916B-EBA5-4919-B018-3F75B08F01B3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Near-Optimal_Algorithms_for_Shortest_Paths_in_Weighted_Unit-Disk_Graphs."}}}}}