Pages that link to "Item:Q5116532"

The following pages link to An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532):

Displaying 5 items.

• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• Distance Domination in Graphs (Q3384610) (← links)
• A linear-time algorithm for radius-optimally augmenting paths in a metric space (Q5918103) (← links)
• Covering uncertain points in a tree (Q5920112) (← links)
• Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)