Pages that link to "Item:Q2564302"

The following pages link to An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302):

Displaying 30 items.

• The minimum \(k\)-storage problem on directed graphs (Q2355709) (← links)
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
• The web proxy location problem in general tree of rings networks (Q2385469) (← links)
• Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
• A \(k\)-product uncapacitated facility location problem (Q2455617) (← links)
• Median problems on wheels and cactus graphs (Q2457944) (← links)
• The \(p\)-maxian problem on a tree (Q2467473) (← links)
• One-way and round-trip center location problems (Q2568335) (← links)
• The balanced 2-median and 2-maxian problems on a tree (Q2687920) (← links)
• Diameter-constrained Steiner trees (Q2905280) (← links)
• Two Paths Location of a Tree with Positive or Negative Weights (Q2942409) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• The most probable allocation solution for the p-median problem (Q3389552) (← links)
• (Q3389573) (← links)
• (Q3718733) (← links)
• (Q4281639) (← links)
• Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
• Computing the 2‐median on tree networks in O(n lg n) time (Q4894868) (← links)
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
• Locating Facilities on a Network to Minimize Their Average Service Radius (Q5387793) (← links)
• Efficient computation of 2-medians in a tree network with positive/negative weights (Q5899357) (← links)
• Efficient computation of 2-medians in a tree network with positive/negative weights (Q5920599) (← links)
• The \(k\)-centrum multi-facility location problem (Q5931794) (← links)
• \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
• Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights (Q6049306) (← links)
• Efficient algorithms for finding <scp>2‐medians</scp> of a tree (Q6087120) (← links)
• The extensive 1-median problem with radius on networks (Q6091088) (← links)
• A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment (Q6495790) (← links)
• On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)
• Robust vertex centdian facility location problem on tree networks (Q6644380) (← links)