Minimum-cost integer circulations in given homology classes

Keyphrases

• Polynomial-time Algorithm 100%
• Minimum Cost 100%
• Homology Class 100%
• Non-orientable Surface 100%
• Feasible Solution 50%
• Directed Graph 50%
• Integer Programming 50%
• Convex Hull 50%
• Dynamic Programming 50%
• Orientable Surface 50%
• Non-negative Integer 50%
• Polyhedral Description 50%
• Stable Set Problem 50%
• Odd Cycle 50%
• Cycle Packing number 50%
• Negative Cost 50%
• Surface Polynomials 50%
• Strong NP-hardness 50%
• Non-orientable 50%

Mathematics

• Integer 100%
• Homology Class 100%
• Orientable Surface 75%
• Polynomial Time 50%
• Stable Set 25%
• Nonnegative Integer 25%
• Feasible Solution 25%
• Convex Hull 25%

Computer Science

• polynomial-time algorithm 100%
• Directed Graphs 50%
• Dynamic Programming 50%
• Integer Program 50%
• Feasible Solution 50%
• Nonnegative Integer 50%