WALCOM 2012: WALCOM: Algorithms and Computation pp 100-111

# On the Round-Trip 1-Center and 1-Median Problems

• Biing-Feng Wang
• Jhih-Hong Ye
• Pei-Jung Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7157)

## Abstract

This paper studies the round-trip single-facility location problem, in which a set A of collection depots is given and the service distance of a customer is defined to be the distance from the server, to the customer, then to a depot, and back to the server. (The input is a graph G whose vertices and edges are weighted, whose vertices represent client positions, and that the set of depots is specified in the input as a subset of the points on G.) We consider the restricted version, in which each customer i is associated with a subset A i  ⊆ A of depots that i can potentially select from and use. Improved algorithms are proposed for the round-trip 1-center and 1-median problems on a general graph. For the 1-center problem, we give an $$O(mn \lg n)$$-time algorithm, where n and m are, respectively, the numbers of vertices and edges. For the 1-median problem, we show that the problem can be solved in $$O(\min\{mn \lg n, mn + n^{2} \lg n + n|A|\})$$ time. In addition, assuming that a matrix that stores the shortest distances between every pair of vertices is given, we give an O(n ∑  i min {|A i |, n} + n|A|)-time algorithm. Our improvement comes from a technique which we use to reduce each set A i . This technique may also be useful in solving the depot location problem on special classes of graphs, such as trees and planar graphs.

## Keywords

Location Problem Planar Graph Distance Matrix Time Algorithm Piecewise Linear Function
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
Benkoczi, R., Bhattacharya, B., Das, S., Sember, J.: Single facility collection depots location problem in the plane. Computational Geometry 42(5), 403–418 (2009)
2. 2.
Benkoczi, R., Bhattacharya, B., Tamir, A.: Collection depots facility location problems in trees. Networks 53(1), 50–62 (2009)
3. 3.
Berman, O., Drezner, Z., Wesolowsky, G.O.: The collection depots location problem on networks. Naval Research Logistics 49(1), 15–24 (2002)
4. 4.
Berman, O., Huang, R.: Minisum collection depots location problem with multiple facilities on a network. Journal of the Operational Research Society 55(7), 769–779 (2004)
5. 5.
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)Google Scholar
6. 6.
Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. In: Proceedings of 39th Annual ACM Symposium on Theory of Computing, pp. 590–598 (2007)Google Scholar
7. 7.
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill (2001)Google Scholar
8. 8.
Drezner, Z., Steiner, G., Wesolowsky, G.O.: One-facility location with rectilinear tour distances. Naval Research Logistics Quarterly 32(3), 391–405 (1985)
9. 9.
Drezner, Z., Wesolowsky, G.O.: A trajectory approach to the round-trip location problem. Transportation Science 16(1), 56–66 (1982)
10. 10.
Drezner, Z., Wesolowsky, G.O.: On the collection depots location problem. European Journal of Operational Research 130(3), 510–518 (2001)
11. 11.
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, part 1: the p-centers. SIAM Journal on Applied Mathematics 37, 539–560 (1979)
12. 12.
Pettie, S.: A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science 312(1), 47–74 (2004)
13. 13.
Tamir, A., Halman, N.: One-way and round-trip center location problems. Discrete Optimization 2(2), 168–184 (2005)

## Authors and Affiliations

• Biing-Feng Wang
• 1
• Jhih-Hong Ye
• 1
• Pei-Jung Chen
• 1
1. 1.Department of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan, Republic of China
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7211393117904663, "perplexity": 4498.4679183172175}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-39/segments/1537267159160.59/warc/CC-MAIN-20180923055928-20180923080328-00096.warc.gz"}