Network flow models
concept- Related → Max-flow min-cut theorem
- Related → Assignment problem
- Related → Shortest path models
- Related → Traveling salesman routing
- Leads to → Max-flow min-cut theorem
FOLLOW AN IDEA
Knowledge graph
Explore concepts, videos and verified content locations.
Nodes and connections
Shortest path models
concept- Related → Minimum spanning tree
- Related → Matroids
- Related → Network flow models
- Related → Traveling salesman routing
Traveling salesman routing
concept- Related → NP-completeness
- Related → Integer relaxations
- Related → Network flow models
- Related → Shortest path models
Max-flow min-cut theorem
concept- Related → Network flow models
- Related → Bipartite matching
- Requires → Network flow models
NP-completeness
concept- Related → Traveling salesman routing
- Related → Approximation algorithms
Minimum spanning tree
concept- Related → Shortest path models
- Related → Graph matchings
Approximation algorithms
concept- Related → NP-completeness
- Related → Integer relaxations
Bipartite matching
concept- Related → Max-flow min-cut theorem
- Related → Assignment problem
- Requires → Graph matchings
Graph matchings
concept- Related → Minimum spanning tree
- Related → Matroids
- Leads to → Bipartite matching
Assignment problem
concept- Related → Bipartite matching
- Related → Network flow models
Integer relaxations
concept- Related → Approximation algorithms
- Related → Traveling salesman routing
Matroids
concept- Related → Graph matchings
- Related → Shortest path models