Approximability of the firefighter problem. Computing cuts over time (Q2428668)

From MaRDI portal
Revision as of 02:36, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximability of the firefighter problem. Computing cuts over time
scientific article

    Statements

    title
    Approximability of the firefighter problem. Computing cuts over time (English)
    0 references
    author
    Elliot Anshelevich
    0 references
    Deeparnab Chakrabarty
    0 references
    Ameya Hate
    0 references
    Chaitanya Swamy
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 April 2012
    0 references
    zbMATH Keywords
    firefighter
    0 references
    approximation algorithms
    0 references
    graph cuts
    0 references
    submodular
    0 references
    vaccination
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    05C90
    0 references
    92D30
    0 references
    zbMATH DE Number
    6028424
    0 references
    OpenAlex ID
    W2023624817
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2428668&oldid=35274966"
    Powered by MediaWiki