Pages that link to "Item:Q4894868"

The following pages link to Computing the 2‐median on tree networks in O(n lg n) time (Q4894868):

Displaying 11 items.

• The connected \(p\)-median problem on block graphs (Q315481) (← links)
• The backup 2-median problem on block graphs (Q403496) (← links)
• Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
• Median problems with positive and negative weights on cycles and cacti (Q604872) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• The 2-radius and 2-radiian problems on trees (Q955029) (← links)
• Efficient algorithms for two generalized 2-median problems and the group median problem on trees (Q1006061) (← links)
• A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
• The multi-service center problem (Q1680546) (← links)
• On discrete preferences and coordination (Q1686225) (← links)
• Finding an optimal core on a tree network with M/G/c/c state-dependent queues (Q1731597) (← links)