On a Fire Fighter’s Problem (Q5384460): 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: How many lions are needed to clear a grid? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential inclusions and the control of forest fires / rank
 
Normal rank
Property / cites work
 
Property / cites work: BLOCKING STRATEGIES FOR A FIRE CONTROL PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of optimal strategies for a fire confinement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum speed for a blocking problem on the half plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent formulation and numerical analysis of a fire confinement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for a dynamic blocking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal strategy for an isotropic blocking problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The firefighter problem for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fire Fighter's Problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147255 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054119500023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2921202237 / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article; zbMATH DE number 7072198
Language Label Description Also known as
English
On a Fire Fighter’s Problem
scientific article; zbMATH DE number 7072198

    Statements

    On a Fire Fighter’s Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2019
    0 references
    motion planning
    0 references
    dynamic environments
    0 references
    spiralling strategies
    0 references
    lower bound
    0 references
    upper bound
    0 references
    barrier
    0 references
    reachable set
    0 references

    Identifiers