Arboral satisfaction: recognition and LP approximation (Q2398493)

From MaRDI portal
Revision as of 06:12, 14 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
Arboral satisfaction: recognition and LP approximation
scientific article

    Statements

    title
    Arboral satisfaction: recognition and LP approximation (English)
    0 references
    author
    Erik D. Demaine
    0 references
    Varun Ganesan
    0 references
    Vladislav Kontsevoi
    0 references
    Qipeng Liu
    0 references
    Quanquan Liu
    0 references
    Fermi Ma
    0 references
    Ofir Nachum
    0 references
    Aaron Sidford
    0 references
    Erik Waingarten
    0 references
    Daniel Ziegler
    0 references
    publication date
    16 August 2017
    0 references
    zbMATH Keywords
    analysis of algorithms
    0 references
    computational geometry
    0 references
    data structures
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68U05
    0 references
    68P05
    0 references
    68W40
    0 references
    90C10
    0 references
    zbMATH DE Number
    6760795
    0 references
    OpenAlex ID
    W2607748884
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2398493&oldid=36339431"
    Powered by MediaWiki