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 50 items.

• The connected \(p\)-median problem on block graphs (Q315481) (← links)
• Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
• The general facility location problem with connectivity on trees (Q335115) (← links)
• The backup 2-median problem on block graphs (Q403496) (← links)
• Maintaining centdians in a fully dynamic forest with top trees (Q479062) (← links)
• A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
• A large class of facets for the \(K\)-median polytope (Q543406) (← links)
• Median problems with positive and negative weights on cycles and cacti (Q604872) (← links)
• Optimizing server placement in distributed systems in the presence of competition (Q635301) (← links)
• Improved complexity results for several multifacility location problems on trees (Q763099) (← links)
• On the exponential cardinality of FDS for the ordered \(p\)-median problem (Q813976) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
• Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
• Two paths location of a tree with positive or negative weights (Q896109) (← links)
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
• Finding the conditional location of a median path on a tree (Q937298) (← links)
• The \(p\)-median polytope of \(Y\)-free graphs: An application of the matching theory (Q943797) (← links)
• On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
• Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474) (← links)
• An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (Q976129) (← links)
• An optimal algorithm for the maximum-density path in a tree (Q989545) (← 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)
• Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
• Finding the \(\ell\)-core of a tree (Q1348250) (← links)
• Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
• 2-medians in trees with pos/neg weights (Q1582068) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Extensive facility location problems on networks: an updated review (Q1667394) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• The multi-service center problem (Q1680546) (← links)
• Finding an optimal core on a tree network with M/G/c/c state-dependent queues (Q1731597) (← links)
• Location routing problems on trees (Q1735670) (← links)
• Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
• A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
• Finding a core of a tree with pos/neg weight (Q1935945) (← links)
• Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
• The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738) (← links)
• An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
• The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers (Q2268861) (← links)
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs (Q2329555) (← links)
• Weighted cache location problem with identical servers (Q2336558) (← links)
• Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
• A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem (Q2339828) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)