Abstract
This paper studies the problem of locating two vertices in a cactus with positive and negative vertex weights. The problem has objective to minimize the sum of minimum weighted distances from every vertex of the cactus to the two medians. We develop an \(O(n^2)\) algorithm for the 2-median problem, where n is the number of vertices of the cactus.
Research was partially supported by NSFC (grant numbers 11571222, 11471210, 61672006).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Benkoczi, R.: Cardinality constrained facility location problems in trees. Ph.D. Thesis, Simon Fraser University (2004)
Benkoczi, R., Breton, D., Bhattacharya, B.: Efficient computation of 2-medians in a tree network with positive/negative weights. Discrete Math. 306(14), 1505–1516 (2006)
Burkard, R.E., Krarup, J.: A linear algorithm for the pos/neg-weighted 1-median problem on cactus. Computing 60(3), 193–215 (1998)
Burkard, R.E., Çela, E., Dollani, H.: 2-median in trees with pos/neg weights. Discrete Appl. Math. 105(14), 51–71 (2000)
Burkard, R.E., Hatzl, J.: Median problems with positive and negative weights on cycles and cacti. J. Comb. Optim. 20(1), 27–46 (2010)
Hatzl, J.: Median problems on wheels and cactus graphs. Computing 80(4), 377–393 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bai, C., Kang, L. (2017). The 2-Median Problem on Cactus Graphs with Positive and Negative Weights. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10627. Springer, Cham. https://doi.org/10.1007/978-3-319-71150-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-71150-8_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71149-2
Online ISBN: 978-3-319-71150-8
eBook Packages: Computer ScienceComputer Science (R0)