The Stackelberg minimum spanning tree game (Q627533)

From MaRDI portal
Revision as of 08:19, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The Stackelberg minimum spanning tree game
scientific article

    Statements

    title
    The Stackelberg minimum spanning tree game (English)
    0 references
    author
    Jean Cardinal
    0 references
    Erik D. Demaine
    0 references
    Samuel Fiorini
    0 references
    Gwenaël Joret
    0 references
    Stefan Langerman
    0 references
    Ilan Newman
    0 references
    Oren Weimann
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 March 2011
    0 references
    zbMATH Keywords
    combinatorial optimization
    0 references
    maximum-revenue pricing
    0 references
    approximation algorithms
    0 references
    spanning trees
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C35
    0 references
    91A43
    0 references
    91A65
    0 references
    05C85
    0 references
    05C57
    0 references
    zbMATH DE Number
    5859350
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q627533&oldid=12527818"
    Powered by MediaWiki