Improved worst-case complexity for the MIN 3-SET COVERING problem (Q2643796): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Frederico Della Croce / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bruno Escoffier / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2023862676 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 3-coloring in time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms and Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2768314 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the complexity of minimum dominating set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4747916 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4414647 / rank | |||
Normal rank |
Latest revision as of 14:19, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved worst-case complexity for the MIN 3-SET COVERING problem |
scientific article |
Statements
Improved worst-case complexity for the MIN 3-SET COVERING problem (English)
0 references
27 August 2007
0 references
worst-case complexity
0 references
exact algorithm
0 references
MIN SET COVERING
0 references