The p-median and p-center Problems on Bipartite Graphs
Authors
Abstract:
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some properties to find exact solutions.
similar resources
The P-center and the P-median Problems in Graphs with Small Number 'ofspanningtrees
In this paper, we will describe some algorithms and give their complexity as following: (1) The algorithm for finding a dominating set of radius r in a vertex-weighted graph with small number of spanning tress. The complexity of this algorithm for the unicyclic graph is O(m.n). (2) The algorithm for finding an absolute and vertex p-center of a vertex-weighted graph with small number of spanning...
full textLocation on Networks: A Survey. Part I: The p-Center and p-Median Problems
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected].. INFORMS is collaborating with JSTOR to digitize, preserve...
full textA heuristic for the p-center problems in graphs
Given a connected graph G, the vertex and edge sets and their cardinalities are denoted by V(G), E(G), n and m, respectively. It is assumed that every vertex o is assigned a non-negative real number w(o), called the weight of o, and every edge uv is assigned a positive real number a(uo), the length of uo. The lengths determine the distance d(u, o) between any two vertices u and o as the minimal...
full textAn O(pn2) algorithm for the p-median and related problems on tree graphs
We improve the complexity bound of the p-median problem on trees by showing that the total running time of the "leaves to root" dynamic programming algorithm is O(pn2).
full textOn the p-median polytope of Y-free graphs
In this paper we consider a well-known class of valid inequalities for the p-median and the uncapacitated facility location polytopes, the odd cycle inequalities. It is known that their separation problem is polynomially solvable. We give a new polynomial separation algorithm based on a reduction from the original graph. Then, we define a non-trivial class of graphs, where the odd cycle inequal...
full textConvex p-partitions of bipartite graphs
A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p ≥ 1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.
full textMy Resources
Journal title
volume 9 issue None
pages 37- 43
publication date 2014-11
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023