Pages that link to "Item:Q1201102"
From MaRDI portal
The following pages link to Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102):
Displaying 19 items.
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- On two restricted ancestors tree problems (Q765480) (← links)
- Variations of the maximum leaf spanning tree problem for bipartite graphs (Q1045917) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- A connection between sports and matroids: how many teams can we beat? (Q1702129) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Group centre and group median of a tree (Q1804070) (← links)
- Multiple bottleneck assignment problem (Q1806893) (← links)
- Categorized bottleneck-minisum path problems on networks (Q1890954) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Maximum matchings in bipartite graphs via strong spanning trees (Q3211115) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- A note on the hardness results for the labeled perfect matching problems in bipartite graphs (Q3598040) (← links)
- Balanced problems on graphs with categorization of edges (Q4458967) (← links)
- Generalized Bottleneck Problems<sup>∗</sup> (Q4859828) (← links)
- (Q5389837) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
- The biobjective minimum-cost perfect matching problem and Chinese postman problem (Q6495384) (← links)
