Pages that link to "Item:Q1670106"
From MaRDI portal
The following pages link to An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106):
Displayed 3 items.
- Expanding maximum capacity path under weighted sum-type distances (Q2144881) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks (Q6192079) (← links)