Resource allocation in bounded degree trees (Q1024215)

From MaRDI portal
Revision as of 13:28, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Resource allocation in bounded degree trees
scientific article

    Statements

    title
    Resource allocation in bounded degree trees (English)
    0 references
    author
    Michael Beder
    0 references
    Yuval Cohen
    0 references
    Dror Rawitz
    0 references
    Reuven Bar Yehuda
    0 references
    published in
    Algorithmica
    0 references
    publication date
    16 June 2009
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    bandwidth allocation
    0 references
    bounded degree trees
    0 references
    scheduling
    0 references
    storage allocation
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68W20
    0 references
    68W25
    0 references
    zbMATH DE Number
    5565301
    0 references
    OpenAlex ID
    W2005960287
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1024215&oldid=38588150"
    Powered by MediaWiki