{"entities":{"Q6981718":{"pageid":21393342,"ns":120,"title":"Item:Q6981718","lastrevid":76286730,"modified":"2026-04-23T13:04:01Z","type":"item","id":"Q6981718","labels":{"en":{"language":"en","value":"An LMP \\(O(\\log n)\\)-approximation algorithm for node weighted prize collecting Steiner tree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8042921"}},"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":"Q6981718$49BA3188-9DF0-4F13-AE5F-F71575F56D36","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1f40ba5095e9375bb8cfcbcc7ad9f4b44258fb65","datavalue":{"value":{"text":"An LMP \\(O(\\log n)\\)-approximation algorithm for node weighted prize collecting Steiner tree","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6981718$FAE2DE3F-4670-4176-ADF7-B5CF0D8FF22B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cc88249360c85671de0163328df68f31c43f28bc","datavalue":{"value":"10.1109/FOCS.2013.67","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6981718$53A13D20-AE3C-4C7C-B1D0-416FA24E44DB","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"297e45d61d4e3f41fa51bacd75996ef59c2a30f3","datavalue":{"value":{"entity-type":"item","numeric-id":344953,"id":"Q344953"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6981718$8E11BC4C-ADE1-4DD7-BA40-E251672C8FCD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"305923ecccb67f1bb359950ff2f6d046b5d6bc77","datavalue":{"value":{"entity-type":"item","numeric-id":344951,"id":"Q344951"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6981718$68A3B7E0-AB67-44A9-B59C-8CC214747FB3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"08cc9d2556e7798c422f145500dc8320eb609504","datavalue":{"value":{"entity-type":"item","numeric-id":401305,"id":"Q401305"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6981718$7AAD8026-0F2C-4CCF-8822-A1E654A23172","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"342bd61e9fcf23d926d4bf6a2d1af5fb769b039c","datavalue":{"value":{"time":"+2025-05-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":"Q6981718$8E3D40CE-D8EA-4F90-9F2C-E265504AA3B4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"62a49b155c9af634e6c3562b1547da1f7c08791a","datavalue":{"value":"68-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6981718$034098DD-57C1-4542-B446-4E3398DE4A49","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"57f167c32409cd84dad7e725a6344d78daf6bdb3","datavalue":{"value":"05-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6981718$C4C11A41-EF38-419E-A6E2-20BF57106F72","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"53aeb1fcbd2f0d31715f68f8c0d9430ea394bc21","datavalue":{"value":"94-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6981718$44CA2C47-22B2-495C-B8F1-BE308F80445B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e1d1eee8410c3c7497ce84cf5f145186ae0c42f3","datavalue":{"value":"8042921","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6981718$C5453342-E350-49A7-BE57-0FD2A0BA1793","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":"Q6981718$6EDD8FEE-41CE-4057-8512-55A9926C5616","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An LMP \\(O(\\log n)\\)-approximation algorithm for node weighted prize collecting Steiner tree","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_LMP_%5C(O(%5Clog_n)%5C)-approximation_algorithm_for_node_weighted_prize_collecting_Steiner_tree"}}}}}