The following pages link to (Q4763416):
Displaying 29 items.
- On the approximability of dense Steiner problems (Q396661) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- A note on the subadditive network design problem (Q1038103) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- A greedy heuristic for a minimum-weight forest problem (Q1317004) (← links)
- A data structure for bicategories, with application to speeding up an approximation algorithm (Q1342258) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- The point-to-point connection problem - analysis and algorithms (Q1377667) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- A 3/2-approximation algorithm for some minimum-cost graph problems (Q2340276) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- A class of heuristics for the constrained forest problem (Q2581555) (← links)
- Fast and Simple Algorithms for Weighted Perfect Matching (Q3439168) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Imposing Connectivity Constraints in Forest Planning Models (Q5166249) (← links)
- Approximation Algorithms for a Network Design Problem (Q5323067) (← links)
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)
- Navigating Forest Straight-Line Programs in Constant Time (Q6485914) (← links)
