Finding kth paths and p-centers by generating and searching good data structures
From MaRDI portal
Publication:4747524
Cited in
(51)- Center location problems on tree graphs with subtree-shaped customers
- Optimal algorithms for the path/tree-shaped facility location problems in trees
- Polynomial algorithms for restricted Euclidean p-centre problems
- Efficient parallel algorithms for r-dominating set and p-center problems on trees
- Locating an absolute center on graphs that are almost trees
- On some geometric selection and optimization problems via sorted matrices
- Modeling uncertainty in networks
- Getting around a lower bound for the minimum Hausdorff distance
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- The centdian subtree on tree networks
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Extensive facility location problems on networks: an updated review
- Optimizing squares covering a set of points
- Continuous bottleneck tree partitioning problems
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two
- Reverse shortest path problem in weighted unit-disk graphs
- Network construction/restoration problems: cycles and complexity
- Minsum \(k\)-sink problem on path networks
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Efficient algorithms for center problems in cactus networks
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- A simple linear algorithm for computing rectilinear 3-centers
- Locating two obnoxious facilities using the weighted maximin criterion
- Bounded fan-out \(m\)-center problem
- Geometric p-center problems with centers constrained to two lines
- The approximability of partial vertex covers in trees
- A finite algorithm for the continuousp-center location problem on a graph
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- Backup 2-center on interval graphs
- 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES
- Efficient algorithms for the one-dimensional \(k\)-center problem
- Improvements on geometric pattern matching problems
- On some geometric selection and optimization problems via sorted matrices
- A centroid labelling technique and its application to path selection in trees
- Dispersion on trees
- scientific article; zbMATH DE number 7205030 (Why is no real title available?)
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- The backup 2‐center and backup 2‐median problems on trees
- Discrete center problems
- Exploiting Structure: Location Problems on Trees and Treelike Graphs
- An O(n n)-time algorithm for the k-center problem in trees
- Exploration of k-edge-deficient temporal graphs
- A tight bound on the min-ratio edge-partitioning problem of a tree
- Geometric pattern matching in d-dimensional space
- Approximation algorithms for partial vertex covers in trees
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- A subquadratic time algorithm for the weighted k-center problem on cactus graphs
- Improved algorithms for optimal k sink location on path networks
- Range minimization problems in path-facility location on trees
- Finding the conditional location of a median path on a tree
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
This page was built for publication: Finding kth paths and p-centers by generating and searching good data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4747524)
