Approximability of covering cells with line segments (Q5919568): Difference between revisions

From MaRDI portal
Merged Item from Q5971036
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: Approximation Schemes for Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Covering Problems with Geometric Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for a geometric set cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of covering cells with line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for maximum independent set of pseudo-disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric red-blue set cover for unit squares and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and APX-hardness results for geometric packing and covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line segment covering of cells in arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering things with things / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating domination on intersection graphs of paths on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Support for Non-piercing Regions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering with non-piercing regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted geometric set cover via quasi-uniform sampling / rank
 
Normal rank

Revision as of 04:21, 20 July 2024

scientific article; zbMATH DE number 7116397
Language Label Description Also known as
English
Approximability of covering cells with line segments
scientific article; zbMATH DE number 7116397

    Statements

    Approximability of covering cells with line segments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2019
    0 references
    11 October 2019
    0 references
    geometric covering
    0 references
    line segment covering
    0 references
    approximation algorithms
    0 references
    \(\mathsf{APX}\)-hardness
    0 references
    \(\mathsf{PTAS}\)
    0 references
    fixed-parameter tractability
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references