Pages that link to "Item:Q1272485"
From MaRDI portal
The following pages link to An efficient algorithm for minimum-weight bibranching (Q1272485):
Displaying 11 items.
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- Effective branching splitting method under cost constraint (Q952828) (← links)
- Approximating optimum branchings in linear time (Q976065) (← links)
- On packing connectors (Q1272488) (← links)
- Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
- Relationship of two formulations for shortest bibranchings (Q2024606) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Equitable partitions into matchings and coverings in mixed graphs (Q2237227) (← links)
- Efficient many-to-Many point matching in one dimension (Q2373930) (← links)
- The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)