Pages that link to "Item:Q2840519"
From MaRDI portal
The following pages link to Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519):
Displaying 7 items.
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359) (← links)
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs (Q3569129) (← links)
- Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope (Q5244302) (← links)
- The caterpillar-packing polytope (Q5890933) (← links)
- The caterpillar-packing polytope (Q5916056) (← links)
- Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)