New Hardness Results for Routing on Disjoint Paths (Q3387753)

From MaRDI portal
Revision as of 09:29, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New Hardness Results for Routing on Disjoint Paths
scientific article

    Statements

    title
    New Hardness Results for Routing on Disjoint Paths (English)
    0 references
    author
    Julia Chuzhoy
    0 references
    David H. Kim
    0 references
    Rachit Nimavat
    0 references
    publication date
    13 January 2021
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    hardness of approximation
    0 references
    disjoint paths
    0 references
    graph routing problems
    0 references
    cites work
    Q4886092
    0 references
    Q3002769
    0 references
    Q4231910
    0 references
    Q3972953
    0 references

    Identifiers

    DOI
    10.1137/17M1146580
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68W25
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    7294218
    0 references
    arXiv ID
    1611.05429
    0 references
    OpenAlex ID
    W3113475418
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3387753&oldid=37087552"
    Powered by MediaWiki