Approximability of the firefighter problem. Computing cuts over time (Q2428668): 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-9469-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023624817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inoculation strategies for victims of viruses and the sum-of-squares partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-Bounded Cuts and Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fire containment in grids of dimension three and higher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut problems in graphs with a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / 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: Q2716536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 02:36, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximability of the firefighter problem. Computing cuts over time
scientific article

    Statements

    Approximability of the firefighter problem. Computing cuts over time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    firefighter
    0 references
    approximation algorithms
    0 references
    graph cuts
    0 references
    submodular
    0 references
    vaccination
    0 references

    Identifiers