Pages that link to "Item:Q5946123"

The following pages link to Approximation algorithms for degree-constrained minimum-cost network-design problems (Q5946123):

Displaying 19 items.

• On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
• Degree-bounded minimum spanning trees (Q1028423) (← links)
• ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) (← links)
• Chain-constrained spanning trees (Q1702777) (← links)
• Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
• Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
• Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
• \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
• The maximum binary tree problem (Q2041978) (← links)
• What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
• The maximum degree \& diameter-bounded subgraph and its applications (Q2392540) (← links)
• Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
• Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
• Lower bounding techniques for the degree-constrained network design problem (Q3057091) (← links)
• Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
• Small degree out‐branchings (Q4805223) (← links)
• A Spectral Approach to Network Design (Q5092510) (← links)
• (Q5743495) (← links)
• The Maximum Binary Tree Problem. (Q5874498) (← links)