Polynomially bounded algorithms for locatingp-centers on a tree

DOI10.1007/BF01581045MaRDI QIDQ3947422zbMATH OpenFDO

Authors R. Chandrasekaran, Arie Tamir

Publication date 1982

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmperfect graphslocation on a treeundirected tree networkdual location modelp-center location problemrigid circuit graphs

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites work

• A characterisation of rigid circuit graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Blocking and anti-blocking pairs of polyhedra
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• On rigid circuit graphs
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Perfect zero–one matrices
• The m-Center Problem
• Time bounds for selection

Cited in

(22)

• The 1-center problem in the plane with independent random weights
• On domination elimination orderings and domination graphs
• Some aspects of the semi-perfect elimination
• Efficient parallel algorithms for r-dominating set and p-center problems on trees
• Efficient algorithms for the one-dimensional \(k\)-center problem
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
• New linear time algorithms for generating perfect elimination orderings of chordal graphs
• Dispersion problem on a convex polygon
• Some aspects of perfect elimination orderings in chordal graphs
• Dually chordal graphs
• Analytical models for locating undesirable facilities
• Bee colony optimization for the \(p\)-center problem
• A note on computing the center of uncertain data on the real line
• The discrete p-dispersion problem
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
• A Class of Balanced Matrices Arising from Location Problems
• Locational analysis
• Perfect edge domination and efficient edge domination in graphs
• One-dimensional \(k\)-center on uncertain data
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
• Dominant, an algorithm for the \(p\)-center problem.

This page was built for publication: Polynomially bounded algorithms for locatingp-centers on a tree

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