Approximation bounds for Black Hole Search problems (Q3548722)

From MaRDI portal
Revision as of 20:03, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Approximation bounds for Black Hole Search problems
scientific article

    Statements

    title
    Approximation bounds for Black Hole Search problems (English)
    0 references
    author
    Ralf Klasing
    0 references
    Euripides Markou
    0 references
    Tomasz Radzik
    0 references
    Fabiano Sarracco
    0 references
    published in
    Networks
    0 references
    publication date
    17 December 2008
    0 references
    zbMATH Keywords
    approximation algorithm
    0 references
    black hole search
    0 references
    graph exploration
    0 references
    mobile agent
    0 references
    inapproximability
    0 references

    Identifiers

    DOI
    10.1002/net.20233
    0 references
    Mathematics Subject Classification ID
    68W25
    0 references
    68M10
    0 references
    68R10
    0 references
    zbMATH DE Number
    5383017
    0 references
    OpenAlex ID
    W4214492366
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3548722&oldid=31672427"
    Powered by MediaWiki