{"entities":{"Q6490970":{"pageid":14069739,"ns":120,"title":"Item:Q6490970","lastrevid":103503329,"modified":"2026-06-06T07:30:13Z","type":"item","id":"Q6490970","labels":{"en":{"language":"en","value":"Near-optimal algorithms for point-line covering problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7836588"}},"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":"Q6490970$4F66F8FA-34CB-41F1-9DF0-D295F773016A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4e95cf365ec613cc618281c89751a836a4bf9227","datavalue":{"value":{"text":"Near-optimal algorithms for point-line covering problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6490970$FA3877C7-6307-48CC-A3CD-B2A7973B11C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0d03752c29b41d1b87b62e2669413b34e8ba69f6","datavalue":{"value":{"entity-type":"item","numeric-id":1599636,"id":"Q1599636"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6490970$341D617B-D603-4A0E-BEB3-9E021B0B6258","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f1c3bcd24d816868b08c4dffdbfff91d7ddfc91c","datavalue":{"value":{"entity-type":"item","numeric-id":1648431,"id":"Q1648431"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6490970$AEB1F883-77E2-482E-A0F1-A70838C6D4AA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"72ce7d9a67faa35e942a183da43448d5f2aacbd9","datavalue":{"value":{"entity-type":"item","numeric-id":557829,"id":"Q557829"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6490970$63778C5B-1484-46CB-BDAC-26037270D5A6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"09037479074b394376ae3abcbf3130c1899f813a","datavalue":{"value":{"entity-type":"item","numeric-id":423935,"id":"Q423935"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6490970$E8B9CCE3-1D1A-4DC4-8F21-25469BD1C0E5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"032f9a20c202a9b1863ae3bd37fdc8353d28eb47","datavalue":{"value":{"time":"+2024-04-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6490970$D3B58AFB-22F4-4D85-B4F0-692CEE4AF897","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6490970$17EC743D-BB8B-481F-AF6A-46D2A51A395A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4de578cc35a872bce60ea9acf7fe7b2fcc1a4d20","datavalue":{"value":"7836588","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6490970$4E9CCFE1-6817-4E7D-9D33-21918FA60FB1","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"354bd32d4f9fd2ed79327e7d9ad62b70cac9f8d8","datavalue":{"value":"line cover","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490970$88A92B6B-632B-4B6C-BAEA-820F71B3D7AE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c5d74e77f979228ea455005db954c8fdf446466c","datavalue":{"value":"rich lines","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490970$F7063C17-F7F5-4A06-9A7A-C5F67F742E5A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1c1f102be7dda831169f823c32d59688694c12be","datavalue":{"value":"exact fitting","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490970$CD217872-1D32-4E63-8143-1173E2A93CF8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"040e5cadc2542137fa22dc2efc65268bb08b809c","datavalue":{"value":"kernelization","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490970$0F34F1C4-A7D2-4C09-9B4F-10B0A8D79C84","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"49eb4dac5aeb1a5fd4804122c81f369b6968def6","datavalue":{"value":"randomized algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490970$028D6370-3B32-400C-8DE0-C951DCAA1896","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d12c3f3bd0bfd35dcf35835c7c8fa1eed01a43f","datavalue":{"value":"complexity lower bounds","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490970$F1A527EC-BAC6-4263-A1BF-5A15CF435935","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3d7dce366d6bdfd1c3f10477b87fd3238c664016","datavalue":{"value":"algebraic computation trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6490970$F2D4515D-0C9F-4DA3-BF32-515A7A97778F","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":"Q6490970$1811A0A1-1080-48C6-BDA3-B60A38DCB179","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"81d86200af3e09e213c607ebb1820dd29c5f83f6","datavalue":{"value":"10.4230/LIPICS.STACS.2022.21","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6490970$E8256426-FFF0-4CAC-AEB1-E88ADD6E7778","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Near-optimal algorithms for point-line covering problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Near-optimal_algorithms_for_point-line_covering_problems"}}}}}