Skip to main content
SpringerLink
Log in

Improved Hardness and Approximation Results for Single Allocation Hub Location

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12290))

Included in the following conference series:

Abstract

Given a metric graph \(G = (V, E, w)\) and an integer k, we aim to find a single allocation k-hub location, which is a spanning subgraph consisting of a clique of size k and an independent set of size \(|V|-k\), such that each node in the independent set is adjacent to exactly one node in the clique. For various optimization objective functions studied in the literature, we present improved hardness and approximation results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The \(\Updelta _{\beta }\) metric uses the parameterized triangle inequality \(w(v_1, v_2) \le \beta (w(v_1, u) + w(u, v_2))\), for all nodes \(v_1, v_2, u \in V\).

References

  1. Alumur, S.A., Kara, B.Y.: Network hub location problems: The state of the art. Eur. J. Oper. Res. 190, 1–21 (2008)

    Article  MathSciNet  Google Scholar 

  2. Brimberg, J., Mladenović, N., Todosijević, R., Uro\(\check{s}\)ević., D.: General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem. Optim. Lett. 11, 377–388 (2017)

    Google Scholar 

  3. Bryan, D.L., O’Kelly, M.E.: Hub-and-spoke networks in air transportation: an analytical review. J. Reg. Sci. 39, 275–295 (1999)

    Article  Google Scholar 

  4. Campbell, J.F.: Integer programming formulations of discrete hub location problems. Eur. J. Oper. Res. 72, 387–405 (1994)

    Article  Google Scholar 

  5. Campbell, J.F.: Hub locaiton and the \(p\)-hub median problem. Oper. Res. 44, 1–13 (1996)

    Article  Google Scholar 

  6. Campbell, J.F., O’Kelly, M.E.: Twenty-five years of hub location research. Transp. Sci. 46, 153–169 (2012)

    Article  Google Scholar 

  7. Chen, L.-H., Cheng, D.-W., Hsieh, S.-Y., Hung, L.-J., Lee, C.-W., Wu, B.Y.: Approximation algorithms for single allocation \(k\)-hub center problem. In: Proceedings of the 33rd Workshop on Combinatorial Mathematics and Computation Theory (CMCT 2016), pp. 13–18 (2016)

    Google Scholar 

  8. Chen, L.-H., Hsieh, S.-Y., Hung, L.-J., Klasing, R.: The approximability of the \(p\)-hub center problem with parameterized triangle inequality. In: Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), pp. 112–123 (2017)

    Google Scholar 

  9. Chen, L.-H., Hsieh, S.-Y., Hung, L.-J., Klasing, R.: Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs. Theor. Comput. Sci. 806, 271–280 (2020)

    Article  MathSciNet  Google Scholar 

  10. Chung, S.H., Myung, Y.S., Tcha, D.W.: Optimal design of a distributed network with a two-level hierarchical structure. Eur. J. Oper. Res. 62, 105–115 (1992)

    Article  Google Scholar 

  11. Ernst, A.T., Hamacher, H., Jiang, H., Krishnamoorthy, M., Woeginger, G.: Uncapacitated single and multiple allocation \(p\)-hub center problems. Comput. Oper. Res. 36, 2230–2241 (2009)

    Article  MathSciNet  Google Scholar 

  12. Farahani, R.Z., Hekmatfar, M., Arabani, A.B., Nikbakhsh, E.: Hub location problems: A review of models, classification, solution techniques, and applications. Comput. Ind. Eng. 64, 1096–1109 (2013)

    Article  Google Scholar 

  13. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., San Francisco (1979)

    Google Scholar 

  14. Hsieh, S.Y., Kao, S.S.: A survey of hub location problems. J. Interconnection Netw. 19, 1940005 (2019)

    Article  Google Scholar 

  15. Iwasa, M., Satio, H., Matsui, T.: Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems. Discrete Appl. Math. 157, 2078–2088 (2009)

    Article  MathSciNet  Google Scholar 

  16. Kara, B.Y.: Modeling and analysis of issues in hub location problems. Ph.D. thesis, Bilkent University Industrial Engineering Department (1999)

    Google Scholar 

  17. Kara, B.Y., Tansel, B.C.: On the single-assignment \(k\)-hub center problem. Eur. J. Oper. Res. 125, 648–655 (2000)

    Article  Google Scholar 

  18. Meyer, T., Ernst, A.T., Krishnamoorthy, M.: A \(2\)-phase algorithm for solving the single allocation \(p\)-hub center problems. Comput. Oper. Res. 36, 3143–3151 (2009)

    Article  Google Scholar 

  19. Sohn, J., Park, S.: A linear program for the two-hub location problem. Eur. J. Oper. Res. 100, 617–622 (1997)

    Article  Google Scholar 

  20. Sohn, J., Park, S.: The single-allocation problem in the interacting three-hub network. Networks 35, 17–25 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

XW, GC, YC and AZ are supported by the NSFC Grants 11771114 and 11971139; YC and AZ are supported by the CSC Grants 201508330054 and 201908330090, respectively. GL is supported by the NSERC Canada.

Author information

Authors and Affiliations

  1. Department of Mathematics, Hangzhou Dianzi University, Hangzhou, China

    Xing Wang, Yong Chen & An Zhang

  2. Taizhou University, Taizhou, China

    Guangting Chen

  3. Department of Computing Science, University of Alberta, Edmonton, Canada

    Guohui Lin

  4. Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China

    Yonghao Wang

Authors
  1. Xing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guangting Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Guohui Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yonghao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. An Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Guohui Lin or An Zhang .

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, Jinhua, China

    Zhao Zhang

  2. Texas Southern University, Houston, TX, USA

    Wei Li

  3. University of Texas at Dallas, Richardson, TX, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, X., Chen, G., Chen, Y., Lin, G., Wang, Y., Zhang, A. (2020). Improved Hardness and Approximation Results for Single Allocation Hub Location. In: Zhang, Z., Li, W., Du, DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science(), vol 12290. Springer, Cham. https://doi.org/10.1007/978-3-030-57602-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57602-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57601-1

  • Online ISBN: 978-3-030-57602-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation