{"entities":{"Q6645368":{"pageid":14256523,"ns":120,"title":"Item:Q6645368","lastrevid":40218587,"modified":"2025-02-13T18:49:45Z","type":"item","id":"Q6645368","labels":{"en":{"language":"en","value":"A polynomial-time \\(\\mathrm{OPT}^\\varepsilon\\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7951096"}},"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":"Q6645368$AE743365-9419-4DB7-8F1C-D28E9DAD4734","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d13b76557af718f2634c2bc1e68fa0e17e203dbd","datavalue":{"value":{"text":"A polynomial-time \\(\\mathrm{OPT}^\\varepsilon\\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6645368$4DA5401F-762D-4DE4-ADCD-24FD0E061835","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0d6f095d434ebca0f638461b7c472ddc2119787f","datavalue":{"value":"10.1137/1.9781611977912.23","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6645368$C888F573-21CF-46C1-A2A3-AE268FC57AB9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"64c32a1eb6dcfae7bfd6565db256351b28ca17cc","datavalue":{"value":{"entity-type":"item","numeric-id":2095111,"id":"Q2095111"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6645368$D033C917-1FBB-4ACC-B267-8DDBC5A524FC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e229a7272481236f52fa95a4480b3f630728e07a","datavalue":{"value":{"entity-type":"item","numeric-id":262250,"id":"Q262250"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6645368$A5A245EE-8ADF-46AD-94E7-E4765FA5A1AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ce13ced405345f01cf2227b5a3d67df2c17de566","datavalue":{"value":{"entity-type":"item","numeric-id":2110606,"id":"Q2110606"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6645368$998EC6C3-9021-4983-81D2-9350DB245651","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0609d9917e6e3ab67a7a5e3d5bbceb01eab6e47c","datavalue":{"value":{"time":"+2024-11-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6645368$88B16649-4A17-42F4-A8C9-2FA6FF8C11D7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6645368$867EBF52-D9F4-4D19-A8AF-EC600A9DBAA6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e589ac8fb1a559e5628fda035d21d260daa3b4bc","datavalue":{"value":"7951096","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6645368$78EB973B-35BE-4603-8ED2-5F5C0730AC4A","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":"Q6645368$C7EE4026-6473-4BD3-8072-BB8323CA29B1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:6645368","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:6645368"}}}}}