Pages that link to "Item:Q378106"
From MaRDI portal
The following pages link to On generalizations of network design problems with degree bounds (Q378106):
Displaying 19 items.
- Heuristics for the network design problem with connectivity requirements (Q281782) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← 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)
- Degree bounded matroids and submodular flows (Q2448960) (← links)
- Iterative methods in combinatorial optimization (Q2920152) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- k-Trails: Recognition, Complexity, and Approximations (Q3186496) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- (Q3569811) (redirect page) (← links)
- On cent-dians of general networks (Q4228770) (← links)
- (Q4982363) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Network Design with Edge-Connectivity and Degree Constraints (Q5443519) (← links)
- (Q5743495) (← links)
- Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)