Pages that link to "Item:Q3910007"
From MaRDI portal
The following pages link to The complexity of designing a network with minimum diameter (Q3910007):
Displayed 12 items.
- Network design for time-constrained delivery using subgraphs (Q395697) (← links)
- Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Maximal and minimal vertex-critical graphs of diameter two (Q1127872) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- Placing Green bridges optimally, with a multivariate analysis (Q2117784) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- Multicast<i>ad hoc</i>routing through mobility-aware Steiner tree meshes with consistency across different mobility models (Q5481720) (← links)
- Reload cost problems: Minimum diameter spanning tree (Q5948962) (← links)