Network design with weighted degree constraints
From MaRDI portal
Publication:429670
DOI10.1016/J.DISOPT.2010.05.004zbMATH Open1241.90159OpenAlexW2114554145MaRDI QIDQ429670FDOQ429670
Authors: Takuro Fukunaga, Hiroshi Nagamochi 
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/128835
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Geometric algorithms and combinatorial optimization
- Degree Bounded Matroids and Submodular Flows
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Approximating minimum bounded degree spanning trees to within one of optimal
- Survivable network design with degree or order constraints
- Additive guarantees for degree-bounded directed network design
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Title not available (Why is that?)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs
- Approximating Directed Weighted-Degree Constrained Networks
- Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs
- Many birds with one stone
- Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
- Spanning trees with minimum weighted degrees
Cited In (12)
- Network Design with Edge-Connectivity and Degree Constraints
- Approximating bounded-degree spanning trees and connected factors with leaves
- Approximation algorithms for connected graph factors of minimum weight
- Network Design with Weighted Degree Constraints
- Global optimization of multilevel electricity market models including network design and graph partitioning
- Network design with weighted players
- Approximating Directed Weighted-Degree Constrained Networks
- Node-weighted Network Design in Planar and Minor-closed Families of Graphs
- Degree constrained node-connectivity problems
- Design networks with bounded pairwise distance
- Approximating directed weighted-degree constrained networks
- Survivable network design problems with weighted degree constraints
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)
