IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i2d10.1007_s10878-016-0003-2.html
   My bibliography  Save this article

Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks

Author

Listed:
  • Rafael F. Santos

    (University of Campinas, UNICAMP)

  • Alessandro Andrioni

    (University of Campinas, UNICAMP)

  • Andre C. Drummond

    (University of Brasilia)

  • Eduardo C. Xavier

    (University of Campinas, UNICAMP)

Abstract

In this paper we study a problem of finding coloured paths of minimum weight in graphs. This problem has applications in WDM optical networks when high bandwidths are required to send data between a pair of nodes in the graph. Let $$G=(V,E)$$ G = ( V , E ) be a (directed) graph with a set of nodes V and a set of edges E in which each edge has an associated positive weight w(i, j), and let $$C = \{1, 2, \ldots , x\}$$ C = { 1 , 2 , … , x } be a set of x colours, $$x \in {\mathbb {N}}$$ x ∈ N . The function $$c : E \mapsto 2^C$$ c : E ↦ 2 C maps each edge of the graph G to a subset of colours. We say that edge e contains colours $$c(e) \subseteq C$$ c ( e ) ⊆ C . Given a positive integer $$k > 1$$ k > 1 , a k-multicolour path is a path in G such that there exists a set of k colours $$K = \{c_1, \ldots , c_k\} \subseteq C$$ K = { c 1 , … , c k } ⊆ C , with $$K \subseteq c(i,j)$$ K ⊆ c ( i , j ) for each edge (i, j) in the path. The problem of finding one or more k-multicolour paths in a graph has applications in optical network and social network analysis. In the former case, the available wavelengths in the optical fibres are represented by colours in the edges and the objective is to connect two nodes through a path offering a minimum required bandwidth. For the latter case, the colours represent relations between elements and paths help identify structural properties in such networks. In this work we investigate the complexity of the multicolour path establishment problem. We show it is NP-hard and hard to approximate. Additionally, we develop Branch and Bound algorithms, ILPs, and heuristics for the problem. We then perform an experimental analysis of the developed algorithms to compare their performances.

Suggested Citation

  • Rafael F. Santos & Alessandro Andrioni & Andre C. Drummond & Eduardo C. Xavier, 2017. "Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 742-778, February.
  • Handle: RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-016-0003-2
    DOI: 10.1007/s10878-016-0003-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-016-0003-2
    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-016-0003-2?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. Donatella Granata & Behnam Behdani & Panos M. Pardalos, 2012. "On the complexity of path problems in properly colored directed graphs," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 459-467, November.
    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. Kai Yang & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du, 2019. "A temporal logic programming approach to planning," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 402-420, August.
    2. Riccardo Dondi & Florian Sikora, 2018. "Finding disjoint paths on edge-colored graphs: more tractability results," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1315-1332, 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.

      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:33:y:2017:i:2:d:10.1007_s10878-016-0003-2. 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.