Pages that link to "Item:Q355516"
From MaRDI portal
The following pages link to On some network design problems with degree constraints (Q355516):
Displaying 12 items.
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Lower bounding techniques for the degree-constrained network design problem (Q3057091) (← links)
- (Q4982363) (← links)
- Network Design with Edge-Connectivity and Degree Constraints (Q5443519) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Approximation algorithms for degree-constrained minimum-cost network-design problems (Q5946123) (← links)