Pages that link to "Item:Q4987673"
From MaRDI portal
The following pages link to Efficient algorithms for the reverse shortest path problem on trees under the hamming distance (Q4987673):
Displaying 7 items.
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
- 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)
- (Q3644697) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)
- Maximum Capacity Path Interdiction Problem with Fixed Costs (Q5193217) (← links)
