Pages that link to "Item:Q2480058"
From MaRDI portal
The following pages link to On the \(k\) edge-disjoint 2-hop-constrained paths polytope (Q2480058):
Displaying 14 items.
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- A complete characterization of jump inequalities for the hop-constrained shortest path problem (Q528561) (← links)
- Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
- Notes on polyhedra associated with hop-constrained paths (Q1807932) (← links)
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
- Trade-offs among degree, diameter, and number of paths (Q2112655) (← links)
- On the number of edges in a graph with many two-hop disjoint paths (Q2192123) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 (Q3177821) (← links)
- The Minimum Spanning <i>k</i>-Core Problem with Bounded CVaR Under Probabilistic Edge Failures (Q3186660) (← links)
- Integer programming formulations for the two 4-hop-constrained paths problem (Q3428909) (← links)
- Hop‐level flow formulation for the survivable network design with hop constraints problem (Q5326786) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)