Pages that link to "Item:Q1977866"

The following pages link to Steiner \(k\)-edge connected subgraph polyhedra (Q1977866):

Displaying 8 items.

• The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
• A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
• On survivable network polyhedra (Q1772416) (← links)
• Minimum Cost ≤k Edges Connected Subgraph Problems (Q2883545) (← links)
• A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
• Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
• Robust capacitated Steiner trees and networks with uniform demands (Q6179720) (← links)