Pages that link to "Item:Q1960523"
From MaRDI portal
The following pages link to Improving spanning trees by upgrading nodes (Q1960523):
Displayed 8 items.
- Complexity of reducing the delay between two nodes by node-based and edge-based upgrading strategies (Q705041) (← links)
- Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- A class of node based bottleneck improvement problems (Q2503225) (← links)
- Improving multicut in directed trees by upgrading nodes (Q2643926) (← links)
- Upgrading edges in the graphical TSP (Q6047867) (← links)
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)