Pages that link to "Item:Q3575159"
From MaRDI portal
The following pages link to Survivable Network Design with Degree or Order Constraints (Q3575159):
Displayed 24 items.
- On some network design problems with degree constraints (Q355516) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- The minimum degree group Steiner problem (Q2065790) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Network-Design with Degree Constraints (Q3088102) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- Sensor fault detection and isolation via networked estimation: rank-deficient dynamical systems (Q6052355) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)
