The following pages link to The path set packing problem (Q1790987):
Displaying 11 items.
- Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
- Chain packing in graphs (Q808291) (← links)
- Edge disjoint Polyp Packing (Q1377661) (← links)
- Approximating disjoint-path problems using packing integer programs (Q1424288) (← links)
- A fast algorithm for the path 2-packing problem (Q2268342) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem (Q2656742) (← links)
- On a Network Design Problem That Is Intractable on Trees (Q3486349) (← links)
- (Q3818327) (← links)
- The board packing problem (Q6167668) (← links)
- On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (Q6575414) (← links)