Pages that link to "Item:Q4747524"
From MaRDI portal
The following pages link to Finding kth paths and p-centers by generating and searching good data structures (Q4747524):
Displayed 50 items.
- Bounded fan-out \(m\)-center problem (Q287146) (← links)
- Backup 2-center on interval graphs (Q442280) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
- Range minimization problems in path-facility location on trees (Q713326) (← 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)
- 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)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- Locating an absolute center on graphs that are almost trees (Q1263510) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
- Modeling uncertainty in networks (Q1310211) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← 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)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- Reverse shortest path problem in weighted unit-disk graphs (Q2154091) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← 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 simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
- The Approximability of Partial Vertex Covers in Trees (Q2971146) (← 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)
- 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES (Q4949990) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q5057419) (← links)
- A centroid labelling technique and its application to path selection in trees (Q5096953) (← links)
- (Q5111728) (← links)
- (Q5111741) (← 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)
- Discrete Center Problems (Q5506720) (← links)
- Exploiting Structure: Location Problems on Trees and Treelike Graphs (Q5506729) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- An improved algorithm for diameter-optimally augmenting paths in a metric space (Q5915544) (← links)
- Exploration of \(k\)-edge-deficient temporal graphs (Q5918789) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Geometric pattern matching in d-dimensional space (Q6102306) (← links)