Pages that link to "Item:Q355516"

The following pages link to On some network design problems with degree constraints (Q355516):

Displaying 8 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)
• The Maximum Binary Tree Problem. (Q5874498) (← links)