Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Congestion minimization for multipath routing via multiroute flows
Chandra Chekuri
, Mark Idleman
Siebel School of Computing and Data Science
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Congestion minimization for multipath routing via multiroute flows'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Congestion
50%
Congestion Mitigation
100%
Dependent Rounding
75%
Derandomization
25%
Disjoint Paths
25%
Disjointness
25%
Fault Tolerance
25%
Log-log
25%
Minimization Problem
50%
Multi Disjoint Paths
25%
Multipath Problem
25%
Multipath Routing
100%
Multiroute Flow
100%
Path Length
25%
Randomized Rounding
25%
Rounding Scheme
25%
Rounding Technique
25%
Routing Problem
25%
SIMPLE Algorithm
25%
Single-path
25%
Computer Science
Approximation (Algorithm)
50%
fault-tolerance
50%
Independent Standard
50%
Minimization Problem
100%
multi path routing
50%
Multipath
50%
Multipath Routing
100%
Routing Problem
100%
Simple Algorithm
50%