A scheme for computing minimum covers within simple regions (Q2428655): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-010-9458-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007268629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601572 / 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: Finding the medial axis of a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-Center Problem with Obstacles / 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: Q2704991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Algorithm for Rectilinear Minimal Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On guarding the vertices of rectilinear domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Voronoi Diagrams in the <i> L <sub>p</sub> </i> -Metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering orthogonal polygons with star polygons: The perfect graph approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Graphs and Orthogonally Convex Covers / 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: POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM / rank
 
Normal rank

Latest revision as of 03:36, 5 July 2024

scientific article
Language Label Description Also known as
English
A scheme for computing minimum covers within simple regions
scientific article

    Statements

    A scheme for computing minimum covers within simple regions (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric optimization
    0 references
    covering
    0 references
    chordal graphs
    0 references
    0 references