The within-strip discrete unit disk cover problem (Q528480): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4504025 / 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: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs / 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: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / 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: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering 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: Covering Points by Unit Disks of Fixed Location / 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: ON THE DISCRETE UNIT DISK COVER PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: New existence proofs ε-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / 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: Covering a set of points in multidimensional space / 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: The searching over separators strategy to solve some NP-hard problems in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous 2-hop broadcast in 2D / 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: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank

Latest revision as of 19:59, 13 July 2024

scientific article
Language Label Description Also known as
English
The within-strip discrete unit disk cover problem
scientific article

    Statements

    The within-strip discrete unit disk cover problem (English)
    0 references
    0 references
    0 references
    12 May 2017
    0 references
    0 references
    computational geometry
    0 references
    geometric set cover
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references