{"entities":{"Q6830331":{"pageid":15121873,"ns":120,"title":"Item:Q6830331","lastrevid":56026075,"modified":"2026-02-26T16:41:23Z","type":"item","id":"Q6830331","labels":{"en":{"language":"en","value":"Approximation algorithms for the maximum weight internal spanning tree problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7118907"}},"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":"Q6830331$434DBEC9-8C89-4786-A737-381FE2FD1F1E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8a2274a9c26bc84a6d1d7e8ed95133b0e9349728","datavalue":{"value":{"text":"Approximation algorithms for the maximum weight internal spanning tree problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6830331$7A5E4D0E-FA97-462C-A62A-B653263C4166","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b93b05f8b6802dbd7931b278ece938d4d17a432b","datavalue":{"value":"1431.68151","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830331$EFE27A06-A850-46B5-B337-77443229C7F8","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"be84af3e7ad5c688459a66d027bbeefa7b907eee","datavalue":{"value":"10.1007/S00453-018-00533-W","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830331$D97E8FA8-0353-4341-BE96-FA2796478BA4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7393b0207d0f3dd972850e1d9213c6ad15bad741","datavalue":{"value":{"entity-type":"item","numeric-id":261380,"id":"Q261380"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830331$C87FF4A9-9617-4E0A-8B27-2A7DCAAE87F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d8444ef2e9dd4226196ce672b5a484f78760db07","datavalue":{"value":{"entity-type":"item","numeric-id":166205,"id":"Q166205"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830331$9950124C-31C9-4D07-B8FB-962B3B04B309","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"970768a5eb85695c7db77bf42029f7d1b36d1c2c","datavalue":{"value":{"entity-type":"item","numeric-id":166206,"id":"Q166206"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830331$1CFD8B74-C982-4CDE-880B-26BFA033443C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"80f17de5018612fb6ee9d45b8f4f49b0292340e8","datavalue":{"value":{"entity-type":"item","numeric-id":313817,"id":"Q313817"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830331$32D59003-90B3-4043-B2BF-320D4057C9C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"41dbec7c40189c2ae2a9b8f384af0ca001053fba","datavalue":{"value":{"entity-type":"item","numeric-id":6830330,"id":"Q6830330"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830331$A1B1F163-78B0-45C1-AE3A-CE70A0499D45","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"65c8fa095fb5e7de7a6818fd747ab8b39647de93","datavalue":{"value":{"entity-type":"item","numeric-id":96582,"id":"Q96582"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6830331$F1EAE093-7015-406B-A3E5-6211B75C6C83","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6c664317ce83ea76073702df3451a3d16657d973","datavalue":{"value":{"time":"+2019-10-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6830331$D8A956A7-83F6-46B9-B0A7-52563783FF28","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830331$6F8FB626-42DF-4670-9DC6-C2768939B183","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830331$459362DB-EE12-45D7-8AA6-9604973707FA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"106c4385ce388b026b141d9a24dbfc509fdaf65f","datavalue":{"value":"7118907","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6830331$5B5E2F9F-43C9-4E75-BE50-7B2F202B8F8F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3a2fcaed19bcb7d9d439dd392033728c7cf9edce","datavalue":{"value":"maximum weight internal spanning tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830331$FEB69C89-6651-4DFB-932D-00C6BBF5383D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"41b951070d044bd9d7cf93b04a0fdae95c0e45f2","datavalue":{"value":"maximum weight matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830331$36A6DE00-B52F-47DD-A1EB-F77355285F7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830331$11E4A152-A8FE-4C82-8EA3-15FDF45E1237","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3d2e2522be9551d10b087fdba2d198c51773b780","datavalue":{"value":"performance analysis","type":"string"},"datatype":"string"},"type":"statement","id":"Q6830331$687D9E99-DD34-4CC0-824A-AC765F1EF82E","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":"Q6830331$BC7B7108-C0E9-4A3F-B639-BB36CA03C446","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation algorithms for the maximum weight internal spanning tree problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximation_algorithms_for_the_maximum_weight_internal_spanning_tree_problem"}}}}}