Pages that link to "Item:Q5946123"

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

Displaying 36 items.

• On some network design problems with degree constraints (Q355516) (← links)
• Network design with weighted degree constraints (Q429670) (← links)
• On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
• Approximating minimum-power degree and connectivity problems (Q547290) (← links)
• Approximating some network design problems with node costs (Q638508) (← links)
• Network design with edge-connectivity and degree constraints (Q839639) (← links)
• Budget constrained minimum cost connected medians (Q876728) (← links)
• Degree-bounded minimum spanning trees (Q1028423) (← links)
• Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
• An \(O(mn)\) algorithm for the 1-maximin problem on a network (Q1304521) (← 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)
• (Q2753931) (← links)
• Efficient algorithms for a simple network design problem (Q2811297) (← links)
• Lower bounding techniques for the degree-constrained network design problem (Q3057091) (← links)
• Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
• Bicriteria Network Design Problems (Q4216149) (← links)
• An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions (Q4319530) (← links)
• Minimum-cost strong network orientation problems: Classification, complexity, and algorithms (Q4540090) (← links)
• Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems (Q4622772) (← links)
• Small degree out‐branchings (Q4805223) (← links)
• Lower bound for the cost of connecting tree with given vertex degree sequence (Q4958799) (← links)
• Service-constrained network design problems (Q5054805) (← links)
• A Spectral Approach to Network Design (Q5092510) (← links)
• Automata, Languages and Programming (Q5466515) (← links)
• (Q5743495) (← links)
• The Maximum Binary Tree Problem. (Q5874498) (← links)