@inproceedings{Mohanta2012ComprehensiveSO, title={Comprehensive Study on Computational Methods for K-Shortest Paths Problem}, author={Kalyan Mohanta and Banibrata Poddar}, year={2012} }

- Published 2012

The application domains like network connection routing, highway and power line engineering, robot motion planning and other optimization problems require the computation of shortest path. Computations of K-shortest paths provide more (K-1) numbers of backup shortest paths for consideration, which enable the applicability of additional constraints on the particular domains. For instance, a biologist can determine the best of an alignment from the available instances of biological sequence… CONTINUE READING

Showing 1-10 of 28 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential