The subdivision-constrained routing requests problem (Q2436672)

From MaRDI portal
Revision as of 15:13, 18 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
The subdivision-constrained routing requests problem
scientific article

    Statements

    The subdivision-constrained routing requests problem (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2014
    0 references
    subdivision
    0 references
    NP-hardness
    0 references
    inapproximability
    0 references
    approximation algorithm
    0 references
    strongly polynomial-time algorithm
    0 references

    Identifiers