The generalized \(p\)-centdian on network
From MaRDI portal
Publication:5937142
DOI10.1007/BF02628558zbMath0977.68003MaRDI QIDQ5937142
Dionisio Perez-Britos, José A. Moreno Pérez
Publication date: 17 January 2002
Published in: Top (Search for Journal in Brave)
90C35: Programming involving graphs or networks
68M10: Network design and communication in computer systems
05C85: Graph algorithms (graph-theoretic aspects)
68R99: Discrete mathematics in relation to computer science
Related Items
The continuous and discrete path‐variance problems on trees, Approximability results for the $p$-centdian and the converse centdian problems, An exact procedure and LP formulations for the leader-follower location problem, Range minimization problems in path-facility location on trees, Multiple voting location problems, Extensive facility location problems on networks with equity measures, A linear time algorithm for connected \(p\)-centdian problem on block graphs
Cites Work
- A correction to the definition of local center
- Duality in the Cent-Dian of a Graph
- Finite Dominating Sets for Network Location Problems
- Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
- A polynomial algorithm for thep-centdian problem on a tree
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph