Network design with weighted degree constraints
From MaRDI portal
(Redirected from Publication:429670)
Recommendations
- Network Design with Weighted Degree Constraints
- Survivable network design problems with weighted degree constraints
- Approximating Directed Weighted-Degree Constrained Networks
- Approximating directed weighted-degree constrained networks
- Approximation algorithms for degree-constrained minimum-cost network-design problems
Cites work
- scientific article; zbMATH DE number 5485590 (Why is no real title available?)
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
- Additive guarantees for degree-bounded directed network design
- Approximating Directed Weighted-Degree Constrained Networks
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Degree Bounded Matroids and Submodular Flows
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
- Geometric algorithms and combinatorial optimization
- Many birds with one stone
- Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
- Spanning trees with minimum weighted degrees
- Survivable network design with degree or order constraints
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
Cited in
(12)- Network design with weighted players
- Design networks with bounded pairwise distance
- Approximating directed weighted-degree constrained networks
- Approximating bounded-degree spanning trees and connected factors with leaves
- Approximating Directed Weighted-Degree Constrained Networks
- Approximation algorithms for connected graph factors of minimum weight
- Survivable network design problems with weighted degree constraints
- Node-weighted Network Design in Planar and Minor-closed Families of Graphs
- Network Design with Edge-Connectivity and Degree Constraints
- Network Design with Weighted Degree Constraints
- Degree constrained node-connectivity problems
- Global optimization of multilevel electricity market models including network design and graph partitioning
This page was built for publication: Network design with weighted degree constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429670)
