Approximation algorithms for degree-constrained minimum-cost network-design problems
From MaRDI portal
Recommendations
Cited in
(39)- Degree-bounded minimum spanning trees
- An \(O(mn)\) algorithm for the 1-maximin problem on a network
- ILP formulation of the degree-constrained minimum spanning hierarchy problem
- Chain-constrained spanning trees
- Refuting a conjecture of goemans on bounded degree spanning trees
- Binary Steiner trees: structural results and an exact solution approach
- \(k\)-trails: recognition, complexity, and approximations
- The maximum binary tree problem
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- The maximum degree \& diameter-bounded subgraph and its applications
- Using Lagrangian dual information to generate degree constrained spanning trees
- Bounded-hops power assignment in ad hoc wireless networks
- scientific article; zbMATH DE number 1670654 (Why is no real title available?)
- Efficient algorithms for a simple network design problem
- Lower bounding techniques for the degree-constrained network design problem
- Network-design with degree constraints
- Spanning trees with generalized degree constraints arising in the design of wireless networks
- Degree bounded network design with metric costs
- On some network design problems with degree constraints
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- Network Design with Weighted Degree Constraints
- Approximating Some Network Design Problems with Node Costs
- Network design with weighted degree constraints
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
- On the approximability of some degree-constrained subgraph problems
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems
- Small degree out‐branchings
- Lower bound for the cost of connecting tree with given vertex degree sequence
- Bounded Degree Group Steiner Tree Problems
- Service-constrained network design problems
- A Spectral Approach to Network Design
- Automata, Languages and Programming
- Approximating minimum-power degree and connectivity problems
- Matroidal degree-bounded minimum spanning trees
- The Maximum Binary Tree Problem.
- Approximating some network design problems with node costs
- Network design with edge-connectivity and degree constraints
- Budget constrained minimum cost connected medians
This page was built for publication: Approximation algorithms for degree-constrained minimum-cost network-design problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946123)
