An exact algorithm for a class of geometric set-cover problems (Q2030243): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A sampling-based exact algorithm for the solution of the minimax diameter clustering problem / 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: Unit disk cover problem in 2D / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the unit disk cover problem in 2D and 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Continuous-Time Service Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Points by Unit Disks of Fixed Location / 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: A scalable exact algorithm for the vertex \(p\)-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE DISCRETE UNIT DISK COVER PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on geometric hitting set problems / rank
 
Normal rank

Latest revision as of 22:38, 25 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for a class of geometric set-cover problems
scientific article

    Statements

    An exact algorithm for a class of geometric set-cover problems (English)
    0 references
    0 references
    0 references
    7 June 2021
    0 references
    0 references
    geometric set-cover
    0 references
    Laguerre-Voronoi diagram
    0 references
    exact algorithm
    0 references
    0 references