Pages that link to "Item:Q860399"

The following pages link to An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks (Q860399):

Displaying 25 items.

• Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462) (← links)
• Sink location to find optimal shelters in evacuation planning (Q339937) (← links)
• Minimax regret 1-sink location problem in dynamic cycle networks (Q477612) (← links)
• Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
• Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
• Multiple sink location problems in dynamic path networks (Q897956) (← links)
• An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths (Q967437) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
• Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
• Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
• Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks (Q5918293) (← links)
• Minimax regret vertex 2-sink location problem in dynamic path networks (Q5963611) (← links)
• Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
• Capacity provisioning for evacuation on path networks (Q6179704) (← links)
• Sink location problems in dynamic flow grid networks (Q6591466) (← links)
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6606161) (← links)
• Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q6621860) (← links)
• Sink location problems in dynamic flow grid networks (Q6633571) (← links)
• Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges (Q6646736) (← links)