Data reductions and combinatorial bounds for improved approximation algorithms (Q899583): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2015.11.010 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W135432853 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W135432853 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1409.3742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms Inspired by Kernelization Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Bound for Spanning Star Forest and Color Saving / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Robust Set Problem: Parameterized Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics for smaller kernels: the differential of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the differential of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the differential of a graph: hardness, approximability and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The differential and the roman domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized independence and domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between the Roman k-domination and Roman domination numbers in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Algorithms for Hitting Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel parameterised approximation algorithm for \textsc{minimum vertex cover} / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the k-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Roman Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the spanning star forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for thek-domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3570028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: R<scp>OMAN DOMINATION</scp>: a parameterized perspective† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ROMAN k-DOMINATION IN GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3595118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman Domination on 2-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on Roman domination numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enclaveless sets and MK-Systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2015.11.010 / rank
 
Normal rank

Latest revision as of 07:46, 10 December 2024

scientific article
Language Label Description Also known as
English
Data reductions and combinatorial bounds for improved approximation algorithms
scientific article

    Statements

    Data reductions and combinatorial bounds for improved approximation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 December 2015
    0 references
    reduction rules
    0 references
    maximization problems
    0 references
    polynomial-time approximation
    0 references
    domination problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers