Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2012.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124937241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lenses in arrangements of pseudo-circles and their applications / 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: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities of efficient solutions of rectilinear polygon cover problems / 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: On Column-Restricted and Priority Covering Integer Programs / 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: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573028 / 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: Hitting sets when the VC-dimension is small / 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: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for the size of epsilon-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted geometric set cover via quasi-uniform sampling / rank
 
Normal rank

Latest revision as of 07:01, 7 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms and APX-hardness results for geometric packing and covering problems
scientific article

    Statements

    Exact algorithms and APX-hardness results for geometric packing and covering problems (English)
    0 references
    0 references
    0 references
    22 January 2014
    0 references
    0 references
    geometric set cover
    0 references
    geometric packing
    0 references
    geometric hitting set
    0 references
    APX-hardness
    0 references
    dynamic programming
    0 references
    0 references