The following pages link to (Q5675543):
Displayed 15 items.
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- Optimum matching forests II: General weights (Q3922479) (← links)
- (Q4017559) (← links)
- An efficient algorithm for minimumk-covers in weighted graphs (Q4083700) (← links)
- On the integer-valued variables in the linear vertex packing problem (Q4136929) (← links)
- Maximum matching of given weight in complete and complete bipartite graphs (Q4206784) (← links)
- Approximation Algorithms for the Traveling Salesman Problem with Range Condition (Q4522112) (← links)
- Halin graphs and the travelling salesman problem (Q4744083) (← links)
- Matching, Euler tours and the Chinese postman (Q4766817) (← links)
- A bidirected generalization of network matrices (Q5487806) (← links)
- On cycle cones and polyhedra (Q5895283) (← links)
- Algorithms (Q5905704) (← links)