A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524)

From MaRDI portal
Revision as of 07:13, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): conf/wads/DeshpandeKDS07, #quickstatements; #temporary_batch_1731475607626)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
scientific article

    Statements

    title
    A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (English)
    0 references
    author
    Ajay Deshpande
    0 references
    Taejung Kim
    0 references
    Erik D. Demaine
    0 references
    Sanjay E. Sarma
    0 references
    publication date
    17 February 2009
    0 references

    Identifiers

    zbMATH DE Number
    5508797
    0 references
    Wikidata QID
    Q56504465
    0 references
    OpenAlex ID
    W2048740780
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3603524&oldid=37899450"
    Powered by MediaWiki