Pages that link to "Item:Q2194857"

The following pages link to An improved algorithm for the minmax regret path center problem on trees (Q2194857):

Displaying 9 items.

• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• On the minmax regret path center problem on trees (Q777269) (← links)
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
• A note on the minmax regret centdian location on trees (Q935247) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)