Algorithms for the line-constrained disk coverage and related problems (Q5896893): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3601572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5115775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on “algorithms for reporting and counting geometric intersections” / 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: AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm / 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: WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for a nonconvex covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some variations on constrained minimum enclosing circle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for base station coverage with minimum total radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the Weighted Unit Disk Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for geometric hitting set problems via local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane / rank
 
Normal rank

Latest revision as of 11:06, 28 July 2024

scientific article; zbMATH DE number 7498705
Language Label Description Also known as
English
Algorithms for the line-constrained disk coverage and related problems
scientific article; zbMATH DE number 7498705

    Statements

    Algorithms for the line-constrained disk coverage and related problems (English)
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    disk coverage
    0 references
    line-constrained
    0 references
    half-plane coverage
    0 references
    geometric coverage
    0 references
    facility location
    0 references

    Identifiers