Skip to main content
SpringerLink
Log in

On Minimum Diameter Spanning Trees under Reload Costs

  • Conference paper
Graph-Theoretic Concepts in Computer Science (WG 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1665))

Included in the following conference series:

Abstract

We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs arise at the nodes of the graph and are depending on the colors of the pair of edges used by a walk through the node.

In this paper we consider the problem of finding a spanning tree of minimum diameter with respect to the underlying reload costs. We present hardness results and lower bounds for the approximability even on graphs with maximum degree 5. On the other hand we provide an exact algorithm for graphs of maximum degree 3.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.-S. Chang and S.-J. Leu, The minimum labeling spanning trees, Information Processing Letters 63 (1997), 277–282. 79

    Google Scholar 

  2. M. R. Garey and D. S. Johnson, Computers and intractability (a guide to the theory of NP-completeness), W.H. Freeman and Company, New York, 1979. 81

    MATH  Google Scholar 

  3. R. Hassin and A. Tamir, On the minimum diameter spanning tree problem, Information processing letters 53 (1995), 109–111. 79, 84, 88

    Article  MATH  MathSciNet  Google Scholar 

  4. O. Kariv and S. L. Hakimi, An algorithmic approach to network location problems, part I: The p-center, SIAM Journal of Applied Mathematics 37 (1979), 513–537. 79

    Article  MATH  MathSciNet  Google Scholar 

  5. S. O. Krumke and H.-C. Wirth, On the minimum label spanning tree problem, Information Processing Letters 66 (1998), no. 2, 81–85. 79

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Würzburg, Am Hubland, 97074, Würzburg, Germany

    Hans-Christoph Wirth & Jan Steffan

Authors
  1. Hans-Christoph Wirth
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Steffan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, 8092, Zürich, Switzerland

    Peter Widmayer , Gabriele Neyer  & Stephan Eidenbenz ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wirth, HC., Steffan, J. (1999). On Minimum Diameter Spanning Trees under Reload Costs. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds) Graph-Theoretic Concepts in Computer Science. WG 1999. Lecture Notes in Computer Science, vol 1665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46784-X_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-46784-X_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66731-5

  • Online ISBN: 978-3-540-46784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation