Pages that link to "Item:Q3703611"

The following pages link to Algorithms for finding P-centers on a weighted tree (for relatively small P) (Q3703611):

Displaying 26 items.

• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• Backup 2-center on interval graphs (Q442280) (← links)
• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
• The 2-radius and 2-radiian problems on trees (Q955029) (← links)
• Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
• Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
• Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
• Algorithms for path medi-centers of a tree (Q1819243) (← links)
• Center problems with pos/neg weights on trees (Q1869485) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
• A self-stabilizing algorithm for finding weighted centroid in trees (Q2443010) (← links)
• w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees (Q2958355) (← links)
• INDUCTIVE ALGORITHMS ON FINITE TREES (Q3490010) (← links)
• An Optimal Algorithm for Weighted Minimax Flow Centers on Trees (Q3991674) (← links)
• An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
• The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
• A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
• Discrete Center Problems (Q5506720) (← links)
• An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
• The extensive 1-median problem with radius on networks (Q6091088) (← links)
• Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)