Improved algorithms for some competitive location centroid problems on paths, trees and graphs

Recommendations

$(r,p)$-centroid problems on paths and trees
A branch-and-cut algorithm for the discrete $(r| p)$-centroid problem
The $(1 | 1)$-centroid problem in the plane with distance constraints
The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints
scientific article; zbMATH DE number 1323029

Cites work

scientific article; zbMATH DE number 4032498 (Why is no real title available?)
scientific article; zbMATH DE number 9247 (Why is no real title available?)
scientific article; zbMATH DE number 193411 (Why is no real title available?)
scientific article; zbMATH DE number 3512145 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 961964 (Why is no real title available?)
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
Algorithms for Voting and Competitive Location on a Network
Algorithms for finding P-centers on a weighted tree (for relatively small P)
An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
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
An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
An optimal algorithm for single maximum coverage location on trees and related problems
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Block-vertex duality and the one-median problem
Combinatorial Optimization with Rational Objective Functions
Fibonacci heaps and their uses in improved network optimization algorithms
Finding kth paths and p-centers by generating and searching good data structures
Multiple voting location and single voting location on trees
On locating new facilities in a competitive environment
Relaxation of the Condorcet and Simpson conditions in voting location
Sequential location problems
Some APX-completeness results for cubic graphs
The Maximum Coverage Location Problem
The complexity of selection and ranking in X+Y and matrices with sorted columns
The least element property of center location on tree networks with applications to distance and precedence constrained problems
Time bounds for selection
Tree-width, path-width, and cutwidth
$(r,p)$-centroid problems on paths and trees

Cited in

(11)

$(r|p)$-centroid problems on networks with vertex and edge demand
A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
An improved algorithm for the p-center problem on interval graphs with unit lengths
On locating new facilities in a competitive environment
scientific article; zbMATH DE number 4020808 (Why is no real title available?)
Relaxed voting and competitive location under monotonous gain functions on trees
A competitive facility location problem on a tree network with stochastic weights.
On fixed-parameter solvability of the minimax path location problem
The $(1 | 1)$-centroid problem in the plane with distance constraints
The nestedness property of location problems on the line
Traveling salesmen in the presence of competition

This page was built for publication: Improved algorithms for some competitive location centroid problems on paths, trees and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2375952)