Skip to main content
SpringerLink
Log in

w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2016)

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

  • 1142 Accesses

Abstract

Let T be a weighted tree with a positive number w(v) associated with each of vertices and a positive number l(e) associated with each of its edges. In this paper we show that each least (w, l)-central subtree of a weighted tree either contains a vertex of the w-centroid or is adjacent to a vertex of the w-centroid. Also, we show that any two least (w, l)-central subtrees of a weighted tree either have a nonempty intersection or are adjacent.

Research was partially supported by NSFC (grant numbers 11571222, 11471210).

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

References

  1. Bielak, H., Pańczyk, M.: A self-stabilizing algorithm for finding weighted centroid in trees. Ann. UMCS Inform. AI XII. 2, 27–37 (2012)

    MathSciNet  MATH  Google Scholar 

  2. Hamina, M., Peltola, M.: Least central subtrees, center, and centroid of a tree. Networks 57, 328–332 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kariv, O., Hakimi, S.L.: An algorithm approach to network location problems. II: the \(p\)-medians. SIAM J. Appl. Math. 37, 539–560 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  4. Nieminen, J., Peltola, M.: The subtree center of a tree. Networks 34, 272–278 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, Shanghai University, Shanghai, 200444, P.R. China

    Erfang Shan

  2. Department of Mathematics, Shanghai University, Shanghai, 200444, P.R. China

    Liying Kang

Authors
  1. Erfang Shan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liying Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liying Kang .

Editor information

Editors and Affiliations

  1. University of Hong Kong, Hong Kong, China

    T-H. Hubert Chan

  2. City University of Hong Kong, Hong Kong, China

    Minming Li

  3. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Shan, E., Kang, L. (2016). w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48749-6_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48748-9

  • Online ISBN: 978-3-319-48749-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation