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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830914500116 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089927779 / rank
 
Normal rank

Latest revision as of 09:53, 30 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

    THE MINIMUM GUARDING TREE PROBLEM (English)
    0 references
    0 references
    0 references
    0 references
    25 April 2014
    0 references
    guarding tree problem
    0 references
    approximation algorithm
    0 references
    NP-hardness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references