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

A Note on Optical Network with Nonsplitting Nodes

Author

Listed:
  • Hongwei Du

    (City University of Hong Kong)

  • Xiaohua Jia

    (City University of Hong Kong)

  • Feng Wang

    (University of Minnesota)

  • My Thai

    (University of Minnesota)

  • Yingshu Li

    (University of Minnesota)

Abstract

We study the problem of computing the minimum total weight multicast route in an optical network with both nonsplitting and splitting nodes, and present a simple approximation with performance ratio 3, which is better than existing one in the literature.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:2:d:10.1007_s10878-005-2273-y
    DOI: 10.1007/s10878-005-2273-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-2273-y
    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-2273-y?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.

    Citations

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


    Cited by:

    1. 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.
    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:2:d:10.1007_s10878-005-2273-y. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.