THE MINIMUM GUARDING TREE PROBLEM (Q5411806): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the minimum corridor connection problem and other generalized geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding a set of line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Watchman routes for lines and line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / 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: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering grids and orthogonal polygons with periscope guards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the minimum-length corridor problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative mobile guards in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On gallery watchmen in grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illumination in the presence of opaque line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Illuminating disjoint line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimum corridor guarding problems / rank
 
Normal rank

Revision as of 10:20, 8 July 2024

scientific article; zbMATH DE number 6288218
Language Label Description Also known as
English
THE MINIMUM GUARDING TREE PROBLEM
scientific article; zbMATH DE number 6288218

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references