{"entities":{"Q6663018":{"pageid":14274175,"ns":120,"title":"Item:Q6663018","lastrevid":95977439,"modified":"2026-06-05T10:08:39Z","type":"item","id":"Q6663018","labels":{"en":{"language":"en","value":"Approximation algorithms and lower bounds for graph burning"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7966918"}},"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":"Q6663018$C68309C3-E775-4C20-96FA-C31909895480","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8c600ebd636b705ce6c59da2f3a5ee53cdfb84b2","datavalue":{"value":{"text":"Approximation algorithms and lower bounds for graph burning","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6663018$7F2A0C78-D9FB-4F88-8367-B91D4531D3C4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"23e2c9031b08167476d2311dd44f84e69cb8ae04","datavalue":{"value":{"entity-type":"item","numeric-id":6176546,"id":"Q6176546"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6663018$4B5982AB-DEAA-4AD9-84C6-85671A0683C7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"68410c8b701a5d2353de4ef8d65f833c0ac3784e","datavalue":{"value":{"entity-type":"item","numeric-id":170016,"id":"Q170016"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6663018$ACC3C8EF-26D9-4630-B431-A2A51F9532DD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1071467fa5dbdd9d84538f23c6a7e1dff2c2643c","datavalue":{"value":{"entity-type":"item","numeric-id":344950,"id":"Q344950"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6663018$48E8B66C-3D0A-4D06-8C05-450C4821A94E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b939f7d6bb04335f584ac4f12e27b7d35776737c","datavalue":{"value":{"time":"+2025-01-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6663018$324F7238-30BC-4E16-AC90-4F63DF19B537","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e01671c873d801b913451010c0981a684c101d40","datavalue":{"value":"68W20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663018$FA7871D6-DE45-4922-87AD-DB5340C045DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663018$AC2B3E20-D590-479C-80CB-A54A52334B9D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663018$480BAF37-B451-467A-9A29-33DA2EAFB32E","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e82d7e8a72b741056cc608040fd3a2424c60bd35","datavalue":{"value":"7966918","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663018$654E128E-D660-4035-830F-785507126151","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ed3b495ba8c3c3bf5babb1d3213a6c0bf58078e5","datavalue":{"value":"graph algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663018$E633A737-F430-4512-BE0C-AE1B07A0378D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cc4837877785b4675d8ac1c6d4c911bcaf794e13","datavalue":{"value":"approximation algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663018$AD9467A6-AFFE-4929-BE2E-FA4E543733BA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"49eb4dac5aeb1a5fd4804122c81f369b6968def6","datavalue":{"value":"randomized algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663018$1B068685-1783-463F-BEB2-2F3FFB9E886A","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":"Q6663018$4AFE709A-7413-47E3-8404-EA8893D17F2F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"7157798f38d5430950f8221948ce8e1a56769600","datavalue":{"value":"10.4230/LIPICS.APPROX/RANDOM.2023.9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663018$580B2BCE-F8E8-453A-9EBD-5BFED24516DC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation algorithms and lower bounds for graph burning","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximation_algorithms_and_lower_bounds_for_graph_burning"}}}}}