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
Multicommodity flows and cuts in polymatroidal networks
Chandra Chekuri
, Sreeram Kannan
, Adnan Raja
,
Pramod Viswanath
Electrical and Computer Engineering
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Multicommodity flows and cuts in polymatroidal networks'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Multicommodity Flow
100%
Polymatroidal Networks
100%
Wireless Networks
33%
Capacitated
33%
Submodular Function
33%
Flow Model
16%
Network Flow
16%
Lower Average
16%
Directed Graph
16%
Natural Places
16%
Israel
16%
Continuous Extension
16%
Capacity Constraints
16%
Yale University
16%
Undirected Graph
16%
Min-cut
16%
Information Flow
16%
Cutting Problem
16%
Network Flow Model
16%
Line Embedding
16%
Network Information Flow
16%
Maximum Flow
16%
Gap Result
16%
Submodular Flows
16%
Multi-commodity Flow Problem
16%
Submodular Capacity
16%
Average Distortion
16%
Multi-commodity
16%
Single Commodity
16%
Undirected Network
16%
Function Embedding
16%
Flow-cut Gap
16%
New Haven
16%
Discrete Mathematics
16%
Opers
16%
Computer Science
Directed Graphs
100%
Wireless Network
100%
Capacity Constraint
50%
Network Flow Model
50%
Undirected Network
50%
Flow Model
50%
Maxflow
50%
Mathematics
Edge
100%
Lovsz Extension
100%
Min-Cut
50%
Incident Edge
50%
Continuous Extension
50%