Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59567529, #quickstatements; #temporary_batch_1709545057628
Created claim: DBLP publication ID (P1635): journals/mst/JansenB13, #quickstatements; #temporary_batch_1731543907597
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-012-9393-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3122973673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of vertex colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown reductions for the minimum weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Losing Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for the Vertex Cover Problem on the Preferred Attachment Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity ecology of parameters: An illustration using bounded max leaf number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover problem parameterized above and below tight bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for Graphs of Bounded Feedback Vertex Set Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of König subgraph problems and above-guarantee vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient fixed-parameter algorithms for weighted vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Flowers and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernel of order \(2k - c\) for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Layer Planarization Parameterized by Feedback Edge Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure and maximum number of maximum independent sets in trees / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/mst/JansenB13 / rank
 
Normal rank

Latest revision as of 01:27, 14 November 2024

scientific article
Language Label Description Also known as
English
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
scientific article

    Statements

    Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (English)
    0 references
    0 references
    0 references
    21 October 2013
    0 references
    kernelization
    0 references
    vertex cover
    0 references
    structural parameterization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers