Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Search by expertise, name or affiliation
Edge disjoint paths revisited
Chandra Chekuri
, Sanjeev Khanna
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Edge disjoint paths revisited'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Edge-disjoint Paths
100%
Edge Disjoint Path Problem
100%
Directed Graph
75%
Approximation Ratio
75%
Greedy Algorithm
50%
Approximation Algorithms
50%
Undirected Graph
50%
LP Relaxation
50%
Number of Edges
25%
Linear Approximation
25%
Hardness Results
25%
Number of Vertices
25%
Sparse Graphs
25%
Acyclic Graph
25%
Edge Capacity
25%
Unsplittable Flow Problem
25%
Dense Graphs
25%
Improved Approximation
25%
LP-rounding
25%
Integrality Gap
25%
Hardness of Approximation
25%
Mathematics
Edge
100%
Path Problem
57%
Greedy Algorithm
28%
Upper Bound
14%
Lower and upper bounds
14%
Linear Approximation
14%
Sparse Graphs
14%
Rounding
14%
Approximability
14%