Currently displaying 1 – 11 of 11

Showing per page

Order by Relevance | Title | Year of publication

Approximation Algorithms for the Traveling Salesman Problem with Range Condition

D. Arun KumarC. Pandu Rangan — 2010

RAIRO - Theoretical Informatics and Applications

We prove that the Christofides algorithm gives a 4 3 approximation ratio for the special case of traveling salesman problem (TSP) in which the maximum weight in the given graph is at most twice the minimum weight for the graphs. A graph is if the number of odd degree vertices in any minimum spanning tree of the given graph is less than 1 4 times the number of vertices in the graph. We prove that the Christofides algorithm is more efficient (in terms of runtime) than the previous existing algorithms...

Nature–inspired metaheuristic algorithms to find near–OGR sequences for WDM channel allocation and their performance comparison

Shonak BansalNeena GuptaArun Kumar Singh — 2017

Open Mathematics

Nowadays, nature–inspired metaheuristic algorithms are most powerful optimizing algorithms for solving the NP–complete problems. This paper proposes three approaches to find near–optimal Golomb ruler sequences based on nature–inspired algorithms in a reasonable time. The optimal Golomb ruler (OGR) sequences found their application in channel–allocation method that allows suppression of the crosstalk due to four–wave mixing in optical wavelength division multiplexing systems. The simulation results...

Page 1

Download Results (CSV)