Pages that link to "Item:Q1282208"
From MaRDI portal
The following pages link to Approximation algorithms for certain network improvement problems (Q1282208):
Displayed 8 items.
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (Q705041) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- On the optimum capacity of capacity expansion problems (Q2472185) (← links)
- A class of node based bottleneck improvement problems (Q2503225) (← links)
- Improving multicut in directed trees by upgrading nodes (Q2643926) (← links)
- Bottleneck Capacity Expansion Problems with General Budget Constraints (Q2765595) (← links)