Pages that link to "Item:Q3906433"

The following pages link to An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems (Q3906433):

Displaying 47 items.

• An efficient algorithm for the length-constrained heaviest path problem on a tree (Q294615) (← links)
• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• Backup 2-center on interval graphs (Q442280) (← links)
• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
• Computing the center of uncertain points on tree networks (Q527423) (← links)
• Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
• Range minimization problems in path-facility location on trees (Q713326) (← links)
• A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
• Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
• Finding the conditional location of a median path on a tree (Q937298) (← links)
• Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← 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)
• Polynomial algorithms for restricted Euclidean p-centre problems (Q1116694) (← links)
• On search over rationals (Q1170866) (← links)
• On locating new facilities in a competitive environment (Q1171986) (← links)
• Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
• K-center and K-median problems in graded distances (Q1274996) (← links)
• Partial and perfect path covers of cographs (Q1281391) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
• Optimal algorithms for generalized searching in sorted matrices (Q1389660) (← links)
• Improved algorithms for several network location problems with equality measures. (Q1408453) (← links)
• Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
• The centdian subtree on tree networks (Q1602695) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Algorithmic results for ordered median problems (Q1866979) (← links)
• Center problems with pos/neg weights on trees (Q1869485) (← 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)
• One-way and round-trip center location problems (Q2568335) (← links)
• The two-center problem of uncertain points on a real line (Q2687919) (← links)
• The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
• A Class of Balanced Matrices Arising from Location Problems (Q3222208) (← links)
• A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)
• Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451) (← links)
• The Kth TSP is pseudopolynomial when TSP is polynomial (Q4554540) (← links)
• A centroid labelling technique and its application to path selection in trees (Q5096953) (← links)
• (Q5111728) (← links)
• An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
• Discrete Center Problems (Q5506720) (← links)
• An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
• Covering uncertain points in a tree (Q5920112) (← links)
• Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
• The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)