Parameterized approximation of dominating set problems (Q975529): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57359917, #quickstatements; #temporary_batch_1711486624475 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On Parameterized Approximability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4393480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parameterized and Exact Computation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Parameterized Complexity of Counting Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parameterized Approximability of the Disjoint Cycle Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Searching the \(k\)-change neighborhood for TSP is W[1]-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5710169 / rank | |||
Normal rank |
Latest revision as of 22:26, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Parameterized approximation of dominating set problems |
scientific article |
Statements
Parameterized approximation of dominating set problems (English)
0 references
9 June 2010
0 references
parameterized complexity
0 references
FPT approximation
0 references
approximation algorithms
0 references