IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v10y2005i4d10.1007_s10878-005-4925-3.html
   My bibliography  Save this article

An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes

Author

Listed:
  • Longjiang Guo

    (Institute of Computer Science and Technology)

  • Weili Wu

    (University of Texas at Dallas)

  • Feng Wang

    (University of Minnesota)

  • My Thai

    (University of Minnesota)

Abstract

Consider the problem of computing the minimum-weight multicast route in an optical network with both nonsplitting and splitting nodes. This problem can be reduced to the minimum Hamiltonian path problem when all nodes are nonsplitting, and the Steiner minimum tree problem when all nodes are splitting. Therefore, the problem is NP-hard. Previously, the best known polynomial-time approximation has the performance ratio 3. In this paper, we present a new polynomial-time approximation with performance ratio of 1+ρ, where ρ is the best known approximation performance ratio for the Steiner minimum tree in graph and it has been known that ρ

Suggested Citation

  • Longjiang Guo & Weili Wu & Feng Wang & My Thai, 2005. "An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 391-394, December.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:4:d:10.1007_s10878-005-4925-3
    DOI: 10.1007/s10878-005-4925-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-4925-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-4925-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Marek Karpinski & Alexander Zelikovsky, 1997. "New Approximation Algorithms for the Steiner Tree Problems," Journal of Combinatorial Optimization, Springer, vol. 1(1), pages 47-65, March.
    2. Hongwei Du & Xiaohua Jia & Feng Wang & My Thai & Yingshu Li, 2005. "A Note on Optical Network with Nonsplitting Nodes," Journal of Combinatorial Optimization, Springer, vol. 10(2), pages 199-202, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dimitri Watel & Marc-Antoine Weisser & Cédric Bentz & Dominique Barth, 2016. "Directed Steiner trees with diffusion costs," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1089-1106, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lai, Xiaofan & Xu, Zhou, 2016. "Improved algorithms for joint optimization of facility locations and network connections," European Journal of Operational Research, Elsevier, vol. 250(3), pages 745-753.
    2. Dimitri Watel & Marc-Antoine Weisser & Cédric Bentz & Dominique Barth, 2016. "Directed Steiner trees with diffusion costs," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1089-1106, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:10:y:2005:i:4:d:10.1007_s10878-005-4925-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.