{"entities":{"Q7444396":{"pageid":32954633,"ns":120,"title":"Item:Q7444396","lastrevid":110412929,"modified":"2026-11-16T19:26:28Z","type":"item","id":"Q7444396","labels":{"en":{"language":"en","value":"An approximation algorithm for minimum cost connected Roman dominating set problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8279619"}},"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":"Q7444396$599FCA8A-0ADF-4397-84BA-22BAC723B589","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"bb88f17f69c4eb1680a2fb63129213ced71908a8","datavalue":{"value":{"text":"An approximation algorithm for minimum cost connected Roman dominating set problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7444396$7EF3F961-5D8A-48FE-9322-67FF61947DBF","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"bd115937fb0d620d270280917ef99f06ab4e42d3","datavalue":{"value":"10.1016/J.TCS.2026.116281","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7444396$64AF0F9A-2A1B-4878-B0D9-8FE623C84AA1","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e2fa8bf1f5566680a6d895320435e41363058a12","datavalue":{"value":{"entity-type":"item","numeric-id":2118229,"id":"Q2118229"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$1AFD8729-F438-43E8-8ED6-260B47732A20","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"749db56ed30793be45710afd38c1d1914e89240e","datavalue":{"value":{"entity-type":"item","numeric-id":247824,"id":"Q247824"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$A228D600-19F0-4B9C-AC63-EE557BF7D568","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"50b03525479ff23cba51de89998d84ad62fe8ae4","datavalue":{"value":{"entity-type":"item","numeric-id":405690,"id":"Q405690"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$266EDAC5-83DC-4BCA-9CF9-8BC078E924B0","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f3c424cd94a60f9664f9fb69cc6027e75cc7ff3f","datavalue":{"value":{"entity-type":"item","numeric-id":123643,"id":"Q123643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$363B353D-1A94-4508-A81C-0CCBCDD69BC6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7444396$43647196-2574-45D6-998F-6CC578105FFC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7444396$534587EC-BA68-49C2-BB74-F20A1E0D4F5A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"712153c14629d39102aae13e913a5fa545e05f4b","datavalue":{"value":"8279619","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7444396$9F0BE639-1D99-4458-969F-7A84ACC16708","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bd6638667702a18be23c50ea04d2dfbaf5d3d71d","datavalue":{"value":"connected Roman dominating set","type":"string"},"datatype":"string"},"type":"statement","id":"Q7444396$E3A32B79-A80E-4682-BD30-48680ED7DE5F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f87bba742306974163f617f805cb2153c05d9c59","datavalue":{"value":"cost function","type":"string"},"datatype":"string"},"type":"statement","id":"Q7444396$842C3373-B29A-48C0-8E0C-7B6F061DD043","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3e1e7eb452ae4c92c43fa47bb0afb8177365a429","datavalue":{"value":"greedy algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q7444396$B938A778-C380-4F85-96CD-0BCD9220AEFD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q7444396$CC3A590C-B454-41AE-A688-9A754110F73C","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":"Q7444396$B0624EAF-C5BA-4F0E-AA4B-649323F002D5","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"58b7b8a6ab52fea42eb44bd04576877ea30da2d6","datavalue":{"value":{"entity-type":"item","numeric-id":1427467,"id":"Q1427467"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$0024E5F0-756D-4E81-AF3C-8215F6ADEDA5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f3a0a247bf407c4ed80e926990474c306094bc5c","datavalue":{"value":{"entity-type":"item","numeric-id":2053064,"id":"Q2053064"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$DC8C90D5-0BA8-4C93-9AA9-7AB1DC54FE8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"56ee212e2c97fab9b207a3c8c594e12604ca9388","datavalue":{"value":{"entity-type":"item","numeric-id":3384116,"id":"Q3384116"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$B05B5961-3DCF-49B5-A2DC-2668E501BD04","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2497fa4d3c2e4490083029f83ddc5a71741fa3d3","datavalue":{"value":{"entity-type":"item","numeric-id":3384605,"id":"Q3384605"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$8EC7FD9E-9AC7-407A-845E-6648682E3B1C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8315c46ed8efbede6e9e999caf944e890b03c80f","datavalue":{"value":{"entity-type":"item","numeric-id":4435567,"id":"Q4435567"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$50A79522-758D-4856-81F0-2C7D2719198A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3c60f029178d593e6e20adb2e501b0ae718d6023","datavalue":{"value":{"entity-type":"item","numeric-id":5897548,"id":"Q5897548"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$F9DB6B15-9228-42DC-A852-534C1F584AA1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a94cb4e0161208dc268d836bca7b6f961bae7a6a","datavalue":{"value":{"entity-type":"item","numeric-id":3560065,"id":"Q3560065"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$9165C1D7-01B3-4085-9E59-883987168D8B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e6eadff009b1f119e1a49304fc63fa2b2707bd90","datavalue":{"value":{"entity-type":"item","numeric-id":2080821,"id":"Q2080821"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$D81D7029-93C4-49CE-9FF8-FD667E989E56","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1ea4506b4a2c5dc7abe85cc464c35f81c506ba35","datavalue":{"value":{"entity-type":"item","numeric-id":6571270,"id":"Q6571270"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7444396$19EB4649-C457-433B-B050-D01A9D57F626","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An approximation algorithm for minimum cost connected Roman dominating set problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_approximation_algorithm_for_minimum_cost_connected_Roman_dominating_set_problems"}}}}}