On Covering Segments with Unit Intervals (Q5864214): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Covering segments with unit squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choice Is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting and covering colored points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on restricted instances of a paint shop problem for words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity dichotomy for \textsc{Steiner Multicut} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine-based methods in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabbing circles for sets of segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for Weighted Set Cover on Unit Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of the Binary Paintshop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental list coloring of graphs, parameterized by conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering things with things / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized algorithm for the hyperplane-cover problem / rank
 
Normal rank

Revision as of 06:23, 29 July 2024

scientific article; zbMATH DE number 7537554
Language Label Description Also known as
English
On Covering Segments with Unit Intervals
scientific article; zbMATH DE number 7537554

    Statements

    On Covering Segments with Unit Intervals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 June 2022
    0 references
    0 references
    segment covering
    0 references
    unit intervals
    0 references
    NP-completeness
    0 references
    parameterized complexity
    0 references