The Most Congested Cutset: Deriving a Tight Lower Bound for the Chromatic Number in the RWA Problem

Sharafat, Ahmad R.; Marouzi, Omid Reza

doi:10.1109/lcomm.2004.832765

Search citation statements

Order By: Relevance

Paper Sections

Select...

Issues With Random Instances1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2006

2009

Publication Types

Select...

Article3

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A generalization and more formal approach was given in [41]. Based on the problem instance's properties, Skorin-Kapov [43] presented a lower bound formulation similar to [40].…”

Section: Issues With Random Instancesmentioning

confidence: 99%

Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm

2009

View full text Add to dashboard Cite

The Routing and Wavelength Assignment problem is a graph optimization problem which deals with optical networks, where communication requests in a network have to be fulfilled. In this paper, we present a multilevel distributed memetic algorithm (ML-DMA) for the static RWA which finds provable optimal solutions for most benchmark instances with known lower bounds and is capable of handling large instances. Components of our ML-DMA include iterated local search, recombination, multilevel scaling, and a gossip-based distribution algorithm. Results demonstrated that our ML-DMA is among the most sophisticated heuristic RWA algorithms published so far.

show abstract

“…A generalization and more formal approach was given in [41]. Based on the problem instance's properties, Skorin-Kapov [43] presented a lower bound formulation similar to [40].…”

Section: Issues With Random Instancesmentioning

confidence: 99%