Inapproximability and approximability of minimal tree routing and coloring (Q935848)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Inapproximability and approximability of minimal tree routing and coloring
scientific article

    Statements

    Inapproximability and approximability of minimal tree routing and coloring (English)
    0 references
    8 August 2008
    0 references
    tree routing
    0 references
    tree coloring
    0 references
    vertex coloring
    0 references
    approximability
    0 references
    inapproximability
    0 references
    multicast connections
    0 references
    0 references
    0 references
    0 references

    Identifiers