{"entities":{"Q5875609":{"pageid":7905160,"ns":120,"title":"Item:Q5875609","lastrevid":93263108,"modified":"2026-06-05T04:05:48Z","type":"item","id":"Q5875609","labels":{"en":{"language":"en","value":"A 21/16-Approximation for the Minimum 3-Path Partition Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7650279"}},"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":"Q5875609$949F1CC1-7F16-451B-AC6F-FF3B6F310650","rank":"normal"}],"P16":[{"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":"Q5875609$8B8DBFD3-E0CF-4153-9A75-786E9DC7E270","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bacf5847130dc014c6b834dba539acff3ce3d716","datavalue":{"value":{"entity-type":"item","numeric-id":300232,"id":"Q300232"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5875609$2041FAA7-5A75-4E79-8866-D453FB442D33","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1084ae1d3233d140a2175e96d64da21b3606dc24","datavalue":{"value":{"entity-type":"item","numeric-id":400516,"id":"Q400516"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5875609$5B5054AB-F0A8-4768-8289-7097999B605D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ca5e8bbbd99a05750ab3875740e0ae09f28b832","datavalue":{"value":{"entity-type":"item","numeric-id":300231,"id":"Q300231"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5875609$63B8AABE-F0EC-4029-BCBA-38C6C6BFC7D7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"26fc6fd907d13476fcf903d6a0078a7bb5dbc0d5","datavalue":{"value":{"entity-type":"item","numeric-id":1750351,"id":"Q1750351"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5875609$41AE27AB-1671-448D-93BE-0832D5B15F8D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"22b8b928399420e5a57e23a0fccc0dce4544e0cc","datavalue":{"value":{"entity-type":"item","numeric-id":262219,"id":"Q262219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5875609$B926D834-5FD7-4A35-9C19-3A2FD5D8E6F7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6695abe38664d65c38747de7b5fe54d9caa92dea","datavalue":{"value":{"time":"+2023-02-03T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5875609$5616A9A2-C8DE-431E-ABFA-BE9793EDE2B5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5875609$6A0AA40D-2348-492C-9A47-A169B3C18662","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3da58708d5099348af17aa3b4005dac0362f5a06","datavalue":{"value":"7650279","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5875609$A2A78FEF-596F-4B8C-84E3-FA5DFA077D8A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"47ee3d261a5475a1aea2c7a5ff8f79f4e72dc906","datavalue":{"value":"\\(3\\)-path partition","type":"string"},"datatype":"string"},"type":"statement","id":"Q5875609$388276E0-E50A-490F-AA3C-7FBC4E60370F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"26d1fb52c5acd6afed79855bb3c68fe99ab7d6e3","datavalue":{"value":"exact set cover","type":"string"},"datatype":"string"},"type":"statement","id":"Q5875609$FE1FDB0E-EED8-4C26-A467-489492CD9ECE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q5875609$158A10AD-49F1-46E2-9D55-3DBB6C9A5C72","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ea1ff5a5e657abc0a392084b74b3342d23f2f4c9","datavalue":{"value":"local search","type":"string"},"datatype":"string"},"type":"statement","id":"Q5875609$C268A35B-8F4C-4D09-890B-31C915AB20D8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7ec37da8502f5286d6e407b7d5b29adece889aef","datavalue":{"value":"amortized analysis","type":"string"},"datatype":"string"},"type":"statement","id":"Q5875609$C65AB00D-2B73-4B29-8057-75144D82E1CB","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":"Q5875609$0AFDD7DE-177C-402E-9C2B-954611DEF117","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"00d342a66dbe6adcd87220aaae41d414d8238ea2","datavalue":{"value":"https://drops.dagstuhl.de/opus/volltexte/2019/11542/pdf/LIPIcs-ISAAC-2019-46.pdf/","type":"string"},"datatype":"url"},"type":"statement","id":"Q5875609$65C60B02-25E6-45D9-BC65-A1259D1AB079","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"00eb3366dd8dd74f60706e87227b136ffd7ff4f9","datavalue":{"value":"W2990814010","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5875609$F9482076-9A65-4D75-9516-0EB1A85CB427","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"04f67d3d7d8f7923b22094d78c0404495167561e","datavalue":{"value":{"text":"A 21/16-Approximation for the Minimum 3-Path Partition Problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5875609$6B48CCF1-64FB-45F8-8602-1BFBDAABF3B6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"698def33bb80944dbe8dc5206eeaa8f2ffae99da","datavalue":{"value":"10.4230/LIPICS.ISAAC.2019.46","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5875609$5AEBFE8B-CB9E-4615-9E76-0BF775CC9948","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A 21/16-Approximation for the Minimum 3-Path Partition Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_21/16-Approximation_for_the_Minimum_3-Path_Partition_Problem"}}}}}