@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00957610v1> a dcat:Dataset ;
    dct:description """
              We consider MIN SET COVERING when the subsets are constrained to have maximum cardinality tree. We propose an exact algorithm whose worst case complexity is bounded above by O* (1.3957n) This is an improvement, based on a refined analysis, of a former result (O*(1.4492n)) by F. Della Croce and V. TH. Paschos, Computing optimal solutions for the MIN 3-SET COVERING problem, Proc. ISSAC'05, LNCS 3827, pp. 685-692.
            """ ;
    dct:identifier "hal-00957610" ;
    dct:issued "2026-05-06T02:18:37.592075"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-06T02:18:37.592079"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Improved worst-case complexity for the MIN 3-SET COVERING problem" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00957610v1/resource/523cc5ed-8d15-468a-a10a-ee2b3832796e> ;
    dcat:keyword "infoeu-reposemanticspreprint",
        "infoinfo-cccomputer-science-cscomputational-complexity-cscc",
        "infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds",
        "infoinfo-rocomputer-science-csoperations-research-mathoc",
        "preprints-working-papers-" ;
    dcat:landingPage <https://hal.science/hal-00957610> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00957610v1/resource/523cc5ed-8d15-468a-a10a-ee2b3832796e> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-06T02:18:37.594056"^^xsd:dateTime ;
    dct:modified "2026-05-06T02:18:37.585707"^^xsd:dateTime ;
    dct:title "Improved worst-case complexity for the MIN 3-SET COVERING problem" ;
    dcat:accessURL <https://hal.science/hal-00957610> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00957610> a foaf:Document .