Algorithms for connected p-centdian problem on block graphs

Algorithms for connected p-centdian problem on block graphs We consider the facility location problem of locating a set $$X_p$$ X p of p facilities (resources) on a network (or a graph) such that the subnetwork (or subgraph) induced by the selected set $$X_p$$ X p is connected. Two problems on a block graph G are proposed: one problem is to minimizes the sum of its weighted distances from all vertices of G to $$X_p$$ X p , another problem is to minimize the maximum distance from each vertex that is not in $$X_p$$ X p to $$X_p$$ X p and, at the same time, to minimize the sum of its distances from all vertices of G to $$X_p$$ X p . We prove that the first problem is linearly solvable on block graphs with unit edge length. For the second problem, it is shown that the set of Pareto-optimal solutions of the two criteria has cardinality not greater than n, and can be obtained in $$O(n^2)$$ O ( n 2 ) time, where n is the number of vertices of the block graph G. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Combinatorial Optimization Springer Journals

Algorithms for connected p-centdian problem on block graphs

Loading next page...
 
/lp/springer_journal/algorithms-for-connected-p-centdian-problem-on-block-graphs-4i642vf78N
Publisher
Springer US
Copyright
Copyright © 2016 by Springer Science+Business Media New York
Subject
Mathematics; Combinatorics; Convex and Discrete Geometry; Mathematical Modeling and Industrial Mathematics; Theory of Computation; Optimization; Operations Research/Decision Theory
ISSN
1382-6905
eISSN
1573-2886
D.O.I.
10.1007/s10878-016-0058-0
Publisher site
See Article on Publisher Site

Abstract

We consider the facility location problem of locating a set $$X_p$$ X p of p facilities (resources) on a network (or a graph) such that the subnetwork (or subgraph) induced by the selected set $$X_p$$ X p is connected. Two problems on a block graph G are proposed: one problem is to minimizes the sum of its weighted distances from all vertices of G to $$X_p$$ X p , another problem is to minimize the maximum distance from each vertex that is not in $$X_p$$ X p to $$X_p$$ X p and, at the same time, to minimize the sum of its distances from all vertices of G to $$X_p$$ X p . We prove that the first problem is linearly solvable on block graphs with unit edge length. For the second problem, it is shown that the set of Pareto-optimal solutions of the two criteria has cardinality not greater than n, and can be obtained in $$O(n^2)$$ O ( n 2 ) time, where n is the number of vertices of the block graph G.

Journal

Journal of Combinatorial OptimizationSpringer Journals

Published: Jul 13, 2016

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off